3894 search results - page 630 / 779 » Approximation Algorithms for Biclustering Problems |
145
Voted
EDBT
2004
ACM
16 years 3 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...
151
Voted
ICDE
2010
IEEE
16 years 3 months ago
2010
IEEE
Uncertain data are inherent in many applications such as environmental surveillance and quantitative economics research. As an important problem in many applications, KNN query has...
126
click to vote
ICDM
2009
IEEE
15 years 10 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...
128
Voted
AAIM
2009
Springer
15 years 10 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...
174
click to vote
SMA
2009
ACM
15 years 10 months ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...