Sciweavers

5746 search results - page 377 / 1150
» Visualizing Query Structure
Sort
View
ICDE
2002
IEEE
149views Database» more  ICDE 2002»
16 years 8 months ago
GADT: A Probability Space ADT for Representing and Querying the Physical World
Large sensor networks are being widely deployed for measurement, detection, and monitoring applications. Many of these applications involve database systems to store and process d...
Anton Faradjian, Johannes Gehrke, Philippe Bonnet
SIGMOD
2000
ACM
143views Database» more  SIGMOD 2000»
15 years 11 months ago
Closest Pair Queries in Spatial Databases
This paper addresses the problem of finding the K closest pairs between two spatial data sets, where each set is stored in a structure belonging in the R-tree family. Five diffe...
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...
CIA
2006
Springer
15 years 10 months ago
Iterative Query-Based Approach to Efficient Task Decomposition and Resource Allocation
Intelligent coordination in complex multi-agent environments requires sophisticated mechanisms for suboptimal task decomposition and efficient resource allocation provided by the t...
Michal Pechoucek, Ondrej Lerch, Jirí B&iacu...
UAI
2003
15 years 8 months ago
Approximate Decomposition: A Method for Bounding and Estimating Probabilistic and Deterministic Queries
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intract...
David Larkin
VISUALIZATION
1996
IEEE
15 years 11 months ago
Real-Time Incremental Visualization of Dynamic Ultrasound Volumes Using Parallel BSP Trees
We present a method for producing real-time volume visualizations of continuously captured, arbitrarily-oriented 2D arrays (slices) of data. Our system constructs a 3D representat...
William F. Garrett, Henry Fuchs, Mary C. Whitton, ...