3894 search results - page 456 / 779 » Approximation Algorithms for Biclustering Problems |
209
Voted
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—The paper deals with efficient distribution of timely information to flows of mobile devices. We consider the case where a set of Information Dissemination Devices (IDDs) broa...
119
Voted
ICDM
2005
IEEE
15 years 10 months ago
2005
IEEE
We consider the problem of integrating a large number of interface schemas over the Deep Web, The scale of the problem and the diversity of the sources present serious challenges ...
141
click to vote
STACS
1999
Springer
15 years 9 months ago
1999
Springer
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
135
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Suppose we are given a finite set of points P in R3 and a collection of polytopes T that are all translates of the same polytope T. We consider two problems in this paper. The firs...
131
Voted
PPDP
2005
Springer
15 years 10 months ago
2005
Springer
The paper describes a constraint-based solution to the protein folding problem on face-centered cubic lattices—a biologically meaningful approximation of the general protein fol...