Sciweavers

841 search results - page 146 / 169
» Approximability of Minimum AND-Circuits
Sort
View
PODS
2009
ACM
110views Database» more  PODS 2009»
14 years 8 months ago
Optimal tracking of distributed heavy hitters and quantiles
We consider the the problem of tracking heavy hitters and quantiles in the distributed streaming model. The heavy hitters and quantiles are two important statistics for characteri...
Ke Yi, Qin Zhang
VLDB
2004
ACM
127views Database» more  VLDB 2004»
14 years 8 months ago
Querying high-dimensional data in single-dimensional space
In this paper, we propose a new tunable index scheme, called iMinMax(), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minim...
Cui Yu, Stéphane Bressan, Beng Chin Ooi, Kian-Lee...
DASFAA
2010
IEEE
166views Database» more  DASFAA 2010»
14 years 2 months ago
The Objects Interaction Matrix for Modeling Cardinal Directions in Spatial Databases
Abstract. Besides topological relations and approximate relations, cardinal directions have turned out to be an important class of qualitative spatial relations. In spatial databas...
Tao Chen, Markus Schneider, Ganesh Viswanathan, We...
ISAAC
2009
Springer
116views Algorithms» more  ISAAC 2009»
14 years 2 months ago
Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm
Given m unit disks and n points in the plane, the discrete unit disk cover problem is to select a minimum subset of the disks to cover the points. This problem is NP-hard [11] and ...
Francisco Claude, Reza Dorrigiv, Stephane Durocher...
TAMC
2009
Springer
14 years 2 months ago
A Simple Greedy Algorithm for the k-Disjoint Flow Problem
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
Maren Martens