6274 search results - page 397 / 1255 » From query complexity to computational complexity |
167
click to vote
CGF
1999
15 years 6 months ago
1999
We describe an approach for interactive collision detection and proximity computations on massive models composed of millions of geometric primitives. We address issues related to...
181
click to vote
CGI
2004
IEEE
15 years 10 months ago
2004
IEEE
Rendering geometric models with complex surface materials in arbitrary lighting environments is a challenging problem. In order to relight and render geometries covered with compl...
178
click to vote
VLDB
2007
ACM
16 years 27 days ago
2007
ACM
Intuitively, aggressive work sharing among concurrent queries in a database system should always improve performance by eliminating redundant computation or data accesses. We show...
186
click to vote
3DIM
2005
IEEE
16 years 13 days ago
2005
IEEE
The computational cost of a collision detection (CD) algorithm on polygonal surfaces depends highly on the complexity of the models. A novel “locally refined” approach is intr...
161
click to vote
ISMIR
2004
Springer
16 years 5 days ago
2004
Springer
Time series representations are common in MIR applications such as query-by-humming, where a sung query might be represented by a series of ‘notes’ for database retrieval. Whi...