28 search results - page 3 / 6 » On the Query Complexity of Testing Orientations for Being Eu... |
STOC
2009
ACM
14 years 6 months ago
2009
ACM
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
CVPR
1997
IEEE
13 years 10 months ago
1997
IEEE
We describe a new multi-phase, color-based image retrieval system, FOCUS Fast Object Color-based qUery System , with an online user interface which is capable of identifying mult...
SIGMOD
2005
ACM
14 years 5 months ago
2005
ACM
Database query languages can be intimidating to the nonexpert, leading to the immense recent popularity for keyword based search in spite of its significant limitations. The holy ...
CIKM
1993
Springer
13 years 9 months ago
1993
Springer
match algorithms that can efficiently handleAbstract complex tests in the presence of large amounts of data. Match algorithms that are capable of handling large amounts of On the o...
COMGEO
2000
ACM
13 years 5 months ago
2000
ACM
We present a fast and accurate collision detection algorithm for haptic interaction with polygonal models. Given a model, we pre-compute a hybrid hierarchical representation, cons...