1461 search results - page 114 / 293 » Complexity of Graph Covering Problems |
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
TOC
2008
14 years 10 months ago
2008
: Ahlswede and Winter [IEEE Trans. Inf. Th. 2002] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound ...
ESWS
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We introduce domain-restricted RDF (dRDF) which allows to associate an RDF graph with a fixed, finite domain that interpretations for it may range over. We show that dRDF...
SIMVIS
2004
14 years 11 months ago
2004
We describe a method to match 3D polygonal geometry models using their internal skeleton graphs. These graphs carry information about the overall shape of the model. In order to m...
120
click to vote
SODA
2012
ACM
13 years 12 days ago
2012
ACM
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...