Sciweavers

5169 search results - page 603 / 1034
» Locality approximation using time
Sort
View
AIPS
2009
15 years 8 months ago
Navigation Planning in Probabilistic Roadmaps with Uncertainty
Probabilistic Roadmaps (PRM) are a commonly used class of algorithms for robot navigation tasks where obstacles are present in the environment. We examine the situation where the ...
Michael Kneebone, Richard Dearden
SMA
2010
ACM
177views Solid Modeling» more  SMA 2010»
15 years 7 months ago
Multi-level grid algorithms for faster molecular energetics
Bio-molecules reach their stable configuration in solvent which is primarily water with a small concentration of salt ions. One approximation of the total free energy of a bio-mol...
Rezaul Alam Chowdhury, Chandrajit L. Bajaj
ICDE
2010
IEEE
282views Database» more  ICDE 2010»
16 years 6 months ago
Quantile-Based KNN Over Multi-Valued Objects
K Nearest Neighbor search has many applications including data mining, multi-media, image processing, and monitoring moving objects. In this paper, we study the problem of KNN over...
Wenjie Zhang, Xuemin Lin, Muhammad Aamir Cheema, Y...
CGF
2008
138views more  CGF 2008»
15 years 7 months ago
Geometry-Aware Framebuffer Level of Detail
This paper introduces a framebuffer level of detail algorithm for controlling the pixel workload in an interactive rendering application. Our basic strategy is to evaluate the sha...
Lei Yang, Pedro V. Sander, Jason Lawrence
DAM
2007
100views more  DAM 2007»
15 years 7 months ago
Partially ordered knapsack and applications to scheduling
In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...
Stavros G. Kolliopoulos, George Steiner