Sciweavers

2188 search results - page 395 / 438
» Instance-Optimal Geometric Algorithms
Sort
View
INFOCOM
2005
IEEE
14 years 2 months ago
Time and energy complexity of distributed computation in wireless sensor networks
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
Nilesh Khude, Anurag Kumar, Aditya Karnik
SAC
2005
ACM
14 years 2 months ago
Estimating manifold dimension by inversion error
Video and image datasets can often be described by a small number of parameters, even though each image usually consists of hundreds or thousands of pixels. This observation is of...
Shawn Martin, Alex Bäcker
IUI
2004
ACM
14 years 2 months ago
Robust sketched symbol fragmentation using templates
Analysis of sketched digital ink is often aided by the division of stroke points into perceptually-salient fragments based on geometric features. Fragmentation has many applicatio...
Heloise Hwawen Hse, Michael Shilman, A. Richard Ne...
SMA
2003
ACM
132views Solid Modeling» more  SMA 2003»
14 years 1 months ago
Tight cocone: a water-tight surface reconstructor
Surface reconstruction from unorganized sample points is an important problem in computer graphics, computer aided design, medical imaging and solid modeling. Recently a few algor...
Tamal K. Dey, Samrat Goswami
VRST
2003
ACM
14 years 1 months ago
Time-critical collision detection using an average-case approach
We present a novel, generic framework and algorithm for hierarchical collision detection, which allows an application to balance speed and quality of the collision detection. We p...
Jan Klein, Gabriel Zachmann