14699 search results - page 396 / 2940 » Complexity and Cognitive Computing |
147
click to vote
SMA
2005
ACM
15 years 10 months ago
2005
ACM
Nef polyhedra in d-dimensional space are the closure of half-spaces under boolean set operation. In consequence, they can represent non-manifold situations, open and closed sets, ...
135
click to vote
BIRTHDAY
2003
Springer
15 years 10 months ago
2003
Springer
The pagination problem of complex documents is in placing text and floating objects on pages in such a way that each object appears close to, but not before, its text reference. ...
156
Voted
CSR
2008
Springer
15 years 5 months ago
2008
Springer
Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst theoreticians. Graph c...
143
click to vote
CAD
2005
Springer
15 years 4 months ago
2005
Springer
Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of...
219
click to vote
CSR
2011
Springer
14 years 8 months ago
2011
Springer
The Goldreich’s function has n binary inputs and n binary outputs. Every output depends on d inputs and is computed from them by the fixed predicate of arity d. Every Goldreich...