Sciweavers

85 search results - page 11 / 17
» Partitioning and ordering large radiosity computations
Sort
View
EDBT
2009
ACM
131views Database» more  EDBT 2009»
13 years 11 months ago
Sample synopses for approximate answering of group-by queries
With the amount of data in current data warehouse databases growing steadily, random sampling is continuously gaining in importance. In particular, interactive analyses of large d...
Philipp Rösch, Wolfgang Lehner
VLDB
2004
ACM
187views Database» more  VLDB 2004»
14 years 1 months ago
Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases
A frequent type of query in spatial networks (e.g., road networks) is to find the K nearest neighbors (KNN) of a given query object. With these networks, the distances between ob...
Mohammad R. Kolahdouzan, Cyrus Shahabi
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
13 years 7 months ago
Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
Stefan Felsner, Lorenz Wernisch
ISCI
2002
130views more  ISCI 2002»
13 years 7 months ago
A study of object declustering strategies in parallel temporal object database systems
In a transaction-time temporal object database management system (TODBMS), updating an object creates a new version of the object, but the old version is still accessible. A TODBM...
Kjetil Nørvåg

Publication
331views
15 years 7 months ago
On Accurate and Efficient Statistical Counting in Sensor-Based Surveillance Systems
Sensor networks have been used in many surveillance systems, providing statistical information about monitored areas. Accurate counting information (e.g., the distribution of the ...
Shuo Guo, Tian He, Mohamed F. Mokbel, John A. Stan...