Sciweavers

1263 search results - page 118 / 253
» A* with Bounded Costs
Sort
View
ICDE
2000
IEEE
168views Database» more  ICDE 2000»
16 years 7 months ago
PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
Paolo Ciaccia, Marco Patella
ICDE
2008
IEEE
117views Database» more  ICDE 2008»
16 years 23 days ago
Region Sampling: Continuous Adaptive Sampling on Sensor Networks
Abstract— Satisfying energy constraints while meeting performance requirements is a primary concern when a sensor network is being deployed. Many recent proposed techniques offer...
Song Lin, Benjamin Arai, Dimitrios Gunopulos, Gaut...
ICC
2007
IEEE
164views Communications» more  ICC 2007»
16 years 20 days ago
Communication Limits with Low Precision Analog-to-Digital Conversion at the Receiver
— We examine the Shannon limits of communication systems when the precision of the analog-to-digital conversion (ADC) at the receiver is constrained. ADC is costly and powerhungr...
Jaspreet Singh, Onkar Dabeer, Upamanyu Madhow
ICALP
2007
Springer
16 years 15 days ago
An Optimal Decomposition Algorithm for Tree Edit Distance
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
Erik D. Demaine, Shay Mozes, Benjamin Rossman, Ore...
SIGGRAPH
2010
ACM
15 years 10 months ago
Subspace self-collision culling
We show how to greatly accelerate self-collision detection (SCD) for reduced deformable models. Given a triangle mesh and a set of deformation modes, our method precomputes Subspa...
Jernej Barbic, Doug L. James