3894 search results - page 637 / 779 » Approximation Algorithms for Biclustering Problems |
135
Voted
COMPGEOM
2010
ACM
15 years 7 months ago
2010
ACM
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
120
Voted
PASTE
2004
ACM
15 years 9 months ago
2004
ACM
A context-sensitive analysis is an analysis in which program elements are assigned sets of properties that depend upon the context in which they occur. For analyses on imperative ...
146
click to vote
COCO
2003
Springer
15 years 8 months ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
123
click to vote
STOC
2010
ACM
15 years 8 months ago
2010
ACM
We study the classic mathematical economics problem of Bayesian optimal mechanism design where a principal aims to optimize expected revenue when allocating resources to self-inte...
114
Voted
VLDB
2001
ACM
15 years 8 months ago
2001
ACM
This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. ...