3875 search results - page 485 / 775 » Approximation algorithms for the 0-extension problem |
158
click to vote
ICDM
2005
IEEE
16 years 8 days 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 ...
171
click to vote
STACS
1999
Springer
15 years 11 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 ...
168
click to vote
CORR
2008
Springer
15 years 6 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...
180
click to vote
PPDP
2005
Springer
16 years 5 days 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...
144
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The paper studies the problem of distributed static parameter (vector) estimation in sensor networks with nonlinear observation models and imperfect inter-sensor communication. We...