1383 search results - page 71 / 277 » On the Complexity of the Interlace Polynomial |
172
click to vote
CG
2002
Springer
15 years 6 months ago
2002
Springer
Convolution surface has the advantage of being crease-free and bulge-free over other kinds of implicit surfaces. Among the various types of skeletal elements, line segments can be...
152
click to vote
IVC
2000
15 years 6 months ago
2000
The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem ...
158
click to vote
ICC
2008
IEEE
16 years 19 days ago
2008
IEEE
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...
192
click to vote
CSR
2007
Springer
16 years 11 days ago
2007
Springer
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
154
click to vote
ICDT
2007
ACM
16 years 10 days ago
2007
ACM
Stay macro tree transducers (smtts) are an expressive formalism for reasoning about XSLT-like document transformations. Here, we consider the exact type checking problem for smtts....