57 search results - page 8 / 12 » isaac 2004 |
ISAAC
2004
Springer
14 years 4 months ago
2004
Springer
We propose a space-efficient scheme for summarizing multidimensional data streams. Our sketch can be used to solve spatial versions of several classical data stream queries effici...
ISAAC
2004
Springer
14 years 4 months ago
2004
Springer
Assuming 3-SAT formulas are hard to refute with high probability, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in t...
ISAAC
2004
Springer
14 years 4 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
ISAAC
2005
Springer
14 years 4 months ago
2005
Springer
Consider two phylogenetic networks N and N′ of size n. The tripartition-based distance finds the proportion of tripartitions which are not shared by N and N′ . This distance i...
ICPR
2004
IEEE
14 years 12 months ago
2004
IEEE
In this project we consider the problem of tracking a soccer player using a static camera. The main goal is to find the position of players in the field at each instance of time t...