Sciweavers

511 search results - page 23 / 103
» Approximate Selection Queries over Imprecise Data
Sort
View
AAAI
2008
15 years 8 months ago
Incremental Algorithms for Approximate Compilation
Compilation is an important approach to a range of inference problems, since it enables linear-time inference in the size S of the compiled representation. However, the main drawb...
Alberto Venturini, Gregory M. Provan
ICRA
2005
IEEE
109views Robotics» more  ICRA 2005»
15 years 11 months ago
Towards an Estimate of Confidence in a Road-Matched Location
- This paper describes a method that provides an estimated location of an outdoor vehicle relative to a digital road map using Belief Theory and Kalman filtering. Firstly, an Exten...
Maan E. El Najjar, Philippe Bonnifait
WSNA
2003
ACM
15 years 11 months ago
Cleaning and querying noisy sensors
Sensor networks have become an important source of data with numerous applications in monitoring various real-life phenomena as well as industrial applications and traffic contro...
Eiman Elnahrawy, Badri Nath
JEA
2008
112views more  JEA 2008»
15 years 6 months ago
Dynamic spatial approximation trees
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
Gonzalo Navarro, Nora Reyes
CLOUDCOM
2010
Springer
15 years 4 months ago
Efficient Metadata Generation to Enable Interactive Data Discovery over Large-Scale Scientific Data Collections
Discovering the correct dataset efficiently is critical for computations and effective simulations in scientific experiments. In contrast to searching web documents over the Intern...
Sangmi Lee Pallickara, Shrideep Pallickara, Milija...