Sciweavers

2944 search results - page 494 / 589
» Improving Bound Propagation
Sort
View
SI3D
2006
ACM
16 years 10 days ago
Interactive 3D distance field computation using linear factorization
We present an interactive algorithm to compute discretized 3D Euclidean distance fields. Given a set of piecewise linear geometric primitives, our algorithm computes the distance...
Avneesh Sud, Naga K. Govindaraju, Russell Gayle, D...
SIGMOD
2006
ACM
121views Database» more  SIGMOD 2006»
16 years 10 days ago
Derby/S: a DBMS for sample-based query answering
Although approximate query processing is a prominent way to cope with the requirements of data analysis applications, current database systems do not provide integrated and compre...
Anja Klein, Rainer Gemulla, Philipp Rösch, Wo...
3DIM
2005
IEEE
16 years 14 hour ago
Multi-Resolution Modeling and Locally Refined Collision Detection for Haptic Interaction
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...
Peiran Liu, Xiaojun Shen, Nicolas D. Georganas, Ge...
CLUSTER
2005
IEEE
16 years 9 hour ago
Toward an Optimal Redundancy Strategy for Distributed Computations
Volunteer distributed computations utilize spare processor cycles of personal computers that are connected to the Internet. The related computation integrity concerns are commonly...
Doug Szajda, Barry Lawson, Jason Owen
DASFAA
2005
IEEE
191views Database» more  DASFAA 2005»
16 years 7 hour ago
An Efficient Approach to Extracting Approximate Repeating Patterns in Music Databases
Pattern extraction from music strings is an important problem. The patterns extracted from music strings can be used as features for music retrieval or analysis. Previous works on ...
Ning-Han Liu, Yi-Hung Wu, Arbee L. P. Chen