1461 search results - page 146 / 293 » Complexity of Graph Covering Problems |
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
We describe a new implementation of the well-known incremental algorithm for constructing Delaunay triangulations in any dimension. Our implementation follows the exact computing ...
LICS
2008
IEEE
15 years 4 months ago
2008
IEEE
The question of whether there is a logic that captures polynomial time is the central open problem in descriptive complexity theory. In my talk, I will review the question and the...
UAI
2004
14 years 11 months ago
2004
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subs...
120
click to vote
Publication
Artificial neural networks, electronic circuits, and gene networks are some examples of systems that can be modeled as networks, that is, as collections of interconnected nodes. I...
144
click to vote
Book
This book is aimed at senior undergraduates and graduate students in Engineering, Science, Mathematics, and Computing. It expects familiarity with calculus, probability theory, and...