1158 search results - page 103 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
227
click to vote
CORR
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
166
click to vote
CIMAGING
2010
15 years 7 months ago
2010
The observations in many applications consist of counts of discrete events, such as photons hitting a detector, which cannot be effectively modeled using an additive bounded or Ga...
168
click to vote
FOCS
2000
IEEE
15 years 10 months ago
2000
IEEE
In many optimization problems, one seeks to allocate a limited set of resources to a set of individuals with demands. Thus, such allocations can naturally be viewed as vectors, wi...
147
click to vote
GLOBECOM
2006
IEEE
16 years 6 days ago
2006
IEEE
— We address the problem of connection preemption in a multi-class network environment. Our objective is: i) to minimize the number of preempted connections, and ii) to minimize ...
133
click to vote
ESA
2004
Springer
15 years 11 months ago
2004
Springer
Many network applications that need to distribute content and data to a large number of clients use a hybrid scheme in which one (or more) multicast channel is used in parallel to...