3946 search results - page 158 / 790 » The computational complexity of choice sets |
172
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
We introduce a new feature size for bounded domains in the plane endowed with an intrinsic metric. Given a point x in a domain X, the homotopy feature size of X at x measures half...
170
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
191
click to vote
MHCI
2004
Springer
15 years 12 months ago
2004
Springer
: The complex usage of mobile devices coupled with their limited resources in terms of display and processing suggests that being able to understand the context of the user would b...
196
click to vote
TOG
2012
13 years 9 months ago
2012
We present a technique for performing high-dimensional filtering of images and videos in real time. Our approach produces high-quality results and accelerates filtering by compu...
154
click to vote
COMPGEOM
2004
ACM
16 years 11 min ago
2004
ACM
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...