36887 search results - page 42 / 7378 » Are We All In the Same |
ICIP
2006
IEEE
14 years 11 months ago
2006
IEEE
In this paper, we analyze the redundancy in calculating all pairs of geodesic distances on a rectangular grid. Fast marching method is an efficient way to estimate the geodesic di...
ICALP
2005
Springer
14 years 2 months ago
2005
Springer
Abstract: The quantum adversary method is one of the most versatile lower-bound methods for quantum algorithms. We show that all known variants of this method are equivalent: spect...
NDSS
1998
IEEE
14 years 1 months ago
1998
IEEE
All-Optical Networks provide ultra-fast data rates, but present a new set of challenges for network security. We present a new algorithm for attack localization in networks. The a...
CPM
1994
Springer
14 years 1 months ago
1994
Springer
Recently, a new compact representation for suboptimal alignments was proposed by Naor and Brutlag (1993). The kernel of that representation is a minimal directed acyclic graph (DAG...
AI
2010
Springer
13 years 9 months ago
2010
Springer
The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with ...