324 search results - page 57 / 65 » Distance Approximating Trees: Complexity and Algorithms |
CIVR
2003
Springer
15 years 4 months ago
2003
Springer
Feature selection for video retrieval applications is impractical with existing techniques, because of their high time complexity and their failure on the relatively sparse trainin...
92
Voted
FSTTCS
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. This paper proposes a new algorithm that improves the complexity bound for solving parity games. Our approach combines McNaughton’s iterated fixed point algorithm with...
107
click to vote
NOMS
2002
IEEE
15 years 4 months ago
2002
IEEE
We present fault localization techniques suitable for diagnosing end-to-end service problems in communication systems with complex topologies. We refine a layered system model th...
161
Voted
FOCS
1997
IEEE
15 years 3 months ago
1997
IEEE
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
111
click to vote
ISAAC
2010
Springer
14 years 9 months ago
2010
Springer
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...