3894 search results - page 620 / 779 » Approximation Algorithms for Biclustering Problems |
128
click to vote
SIGMOD
2010
ACM
15 years 3 months ago
2010
ACM
Many websites provide restrictive form-like interfaces which allow users to execute search queries on the underlying hidden databases. In this paper, we consider the problem of es...
123
Voted
CGF
2008
15 years 3 months ago
2008
We describe algorithms for canonically partitioning semi-regular quadrilateral meshes into structured submeshes, using an adaptation of the geometric motorcycle graph of Eppstein ...
110
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We address the problem of building an index for a set D of n strings, where each string location is a subset of some finite integer alphabet of size , so that we can answer effici...
111
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We propose a model for deterministic distributed function computation by a network of identical and anonymous nodes. In this model, each node has bounded computation and storage c...
110
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...