3875 search results - page 649 / 775 » Approximation algorithms for the 0-extension problem |
125
click to vote
STOC
2001
ACM
16 years 4 months ago
2001
ACM
We study the problem of finding an outlier-free subset of a set of points (or a probability distribution) in n-dimensional Euclidean space. As in [BFKV 99], a point x is defined t...
246
click to vote
VLDB
2007
ACM
16 years 4 months ago
2007
ACM
We present STAR, a self-tuning algorithm that adaptively sets numeric precision constraints to accurately and efficiently answer continuous aggregate queries over distributed data...
155
click to vote
EDBT
2004
ACM
16 years 4 months ago
2004
ACM
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
130
click to vote
ICDM
2009
IEEE
15 years 11 months ago
2009
IEEE
Given a data matrix, the problem of finding dense/uniform sub-blocks in the matrix is becoming important in several applications. The problem is inherently combinatorial since th...
134
click to vote
AAIM
2009
Springer
15 years 11 months ago
2009
Springer
This paper studies the aggregation of messages in networks that consist of a chain of nodes, and each message is time-constrained such that it needs to be aggregated during a give...