1158 search results - page 81 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
177
Voted
CCCG
2009
15 years 7 months ago
2009
We study a maximum flow problem in a polygonal domain P: Determine the maximum number of disjoint "thick" paths (of specified width w) through P from a source edge to a ...
159
click to vote
VLSID
2007
IEEE
16 years 7 months ago
2007
IEEE
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
160
click to vote
WSC
2004
15 years 8 months ago
2004
In time-parallel simulation, the simulation time axis is decomposed into a number of slices which are assigned to parallel processes for concurrent simulation. Although a promisin...
308
click to vote
ICDE
2008
IEEE
16 years 8 months ago
2008
IEEE
Abstract-- We investigate the problem of clustering on distributed data streams. In particular, we consider the k-median clustering on stream data arriving at distributed sites whi...
184
click to vote
COMPGEOM
2004
ACM
16 years 4 days ago
2004
ACM
We consider the problem of approximate range counting over streams of d-dimensional points. In the data stream model, the algorithm makes a single scan of the data, which is prese...