42230 search results - page 155 / 8446 » Algorithms and Complexity Results for |
ICCNMC
2005
Springer
15 years 3 months ago
2005
Springer
This study deals with the topology discovery for the capacitated minimum spanning tree network. The problem is composed of finding the best way to link nodes to a source node and, ...
159
click to vote
ICDE
1999
IEEE
15 years 11 months ago
1999
IEEE
Most operations of the relational algebra or SQL require a sorted stream of tuples for efficient processing. Therefore, processing complex relational queries relies on efficient a...
TCS
1998
14 years 9 months ago
1998
Results on random oracles typically involve showing that a class {X : P(X)} has Lebesgue measure one, i.e., that some property P(X) holds for “almost every X.” A potentially m...
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we consider two basic questions regarding the query complexity of testing graph properties in the adjacency matrix model. The first question refers to the relation ...
IVC
2002
14 years 9 months ago
2002
In this paper we address the problem of reliable real-time 3D-tracking of multiple objects which are observed in multiple wide-baseline camera views. Establishing the spatio-tempo...