Exploració per autor "Díaz Cort, Josep"
Ara es mostren els items 65-84 de 94
-
On list k-coloring convex bipartite graphs
(Springer, 2020)
Text en actes de congrés
Accés obertList k–Coloring (LI k-COL) is the decision problem asking if a given graph admits a proper coloring compatible with a given list assignment to its vertices with colors in {1,2,..., k}. The problem is known to be NP-hard ... -
On RNC approximate counting
(1994-11)
Report de recerca
Accés obertIn this work we look into the parallelization (in the NC sense) of the Markov Chain approach to almost random generation (as described by Sinclair (1993)). We prove that for several problems rapid mixing is -
On some "non uniform" complexity measures
(1985)
Report de recerca
Accés obertNon-uniform complexity measures origined in Automata and Formal Languages Theory are characterized in terms of well-known uniform complexity classes. The initial index of languages is introduced by means of several ... -
On the expected depth of boolean circuits
(1994-02)
Report de recerca
Accés obertIn this paper we analyze the expected depth of a circuit randomly generated from a uniform model. We show that the expected depth of such circuits is polylogarithmic in the number of gates. This result allows us to place ... -
On the power of mediators
(2009)
Article
Accés restringit per política de l'editorialWe consider a problem at the intersection of distributed computing and game theory, namely: Is it; possible to achieve the "windfall of malice" even without the actual presence of malicious players'? Our answer to this ... -
On the relation between graph distance and Euclidean distance in random geometric graphs
(2016-09-01)
Article
Accés obertGiven any two vertices u, v of a random geometric graph G(n, r), denote by dE(u, v) their Euclidean distance and by dE(u, v) their graph distance. The problem of finding upper bounds on dG(u, v) conditional on dE(u, v) ... -
On the stability of generalized second price auctions with budgets
(Springer, 2014)
Text en actes de congrés
Accés obertThe Generalized Second Price (GSP) auction used typically to model sponsored search auctions does not include the notion of budget constraints, which is present in practice. Motivated by this, we introduce the different ... -
On the stability of generalized second price auctions with budgets
(2016-07)
Article
Accés obertThe Generalized Second Price (GSP) auction used typically to model sponsored search auctions does not include the notion of budget constraints, which is present in practice. Motivated by this, we introduce the different ... -
On unification over unrestricted pairs of trees
(1989-01)
Report de recerca
Accés obertIn this work, we deal with the unification of unrestricted (i.e. inifiable and non-unifiable) pais of binary trees with uniform probability distribution. The following results are obtained: Almost all pairs of binary trees ... -
Parallel approximation schemes for problems on planar graphs
(1993-03)
Report de recerca
Accés obertThis paper describes a technique to obtain NC approximation schemes for the Maximum Independent Set in planar graphs and related optimization problems. -
Problems and conjectures on parameterized H-coloring
(2002-03)
Report de recerca
Accés obert -
Random geometric problems on $[0,1]^2$
(1998-09)
Report de recerca
Accés obertIn this paper we survey the work done for graphs on random geometric models. We present some heuristics for the problem of the Minimal Linear Arrangement on [0,1]^2 and we conclude with a collection of open problems. -
Recent developments in structural complexity
(1988)
Report de recerca
Accés obertThis survey presents some of the recent developments in the field of structural complexity. The survey does not intend to give an exhaustive look in each one of the areas of structural complexity which have been developed ... -
Recent results on parameterized H-coloring
(2002-03)
Report de recerca
Accés obertWe survey recent results on the complexity of several versions of the H-coloring and the list-H-coloring problems that are amenable to parameterization. -
Reconstruction of random geometric graphs: breaking the Ω(r) distortion barrier
(2023-10-03)
Article
Accés obertEmbedding graphs in a geographical or latent space, i.e. inferring locations for vertices in Euclidean space or on a smooth manifold or submanifold, is a common task in network analysis, statistical inference, and graph ... -
Sampling matchings in parallel
(1998-03)
Report de recerca
Accés obertWe present a parallel algorithm to sample matchings from an almost uniform distribution on the set of matchings of all sizes in a graph. The technique used is based on the definition of a genetic system that converges ... -
Sequential and parallel complexity of learning DFA
(Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics, 1993)
Text en actes de congrés
Accés obertIt is known that the class of deterministic finite automata is polynomial time learnable by using membership and equivalence queries. We investigate the query complexity of learning deterministic finite automata, i.e., ... -
Simulation of complicated queries by membership queries
(1990)
Report de recerca
Accés obertIn this paper, we consider the following type of learning: a teacher has some set, which is called a (target) concept, in his mind, and a learner tries to obtain the representation of the concept by asking queries on it ... -
Some remarks on the approximability of graph layout problems
(1994-03)
Report de recerca
Accés obertIn this paper we look at several well known layout problems. We show that MINCUT layout and Topological bandwidth cannot be approximated unless P=NP, whereas the Maximum linear arrangement problem can be approximated within ... -
SPALINET: Red Española de lidares de aerosoles
(2008)
Text en actes de congrés
Accés restringit per política de l'editorial
