3946 search results - page 380 / 790 » The computational complexity of choice sets |
175
click to vote
DCG
2010
15 years 5 months ago
2010
We show that any family of sets uniformly definable in an ominimal structure has an extended compression scheme of size equal to the number of parameters in the defining formula. ...
242
click to vote
CVPR
2007
IEEE
16 years 9 months ago
2007
IEEE
We present an algorithm, Hierarchical ISOmetric SelfOrganizing Map (H-ISOSOM), for a concise, organized manifold representation of complex, non-linear, large scale, high-dimension...
194
click to vote
FOCS
2007
IEEE
16 years 1 months ago
2007
IEEE
We introduce a new primitive called Intrusion-Resilient Secret Sharing (IRSS), whose security proof exploits the fact that there exist functions which can be efficiently computed ...
199
click to vote
CVPR
2001
IEEE
16 years 9 months ago
2001
IEEE
We present a new feature based algorithm for stereo correspondence. Most of the previous feature based methods match sparse features like edge pixels, producing only sparse dispar...
183
click to vote
CVPR
2010
IEEE
16 years 3 months ago
2010
IEEE
Scene recognition in an unconstrained setting is an open and challenging problem with wide applications. In this paper, we study the role of scene dynamics for improved representa...