1370 search results - page 179 / 274 » On grids in topological graphs |
151
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
We present a unified framework for modeling and solving invariant point pattern matching problems. Invariant features are encoded as potentials in a probabilistic graphical model....
161
click to vote
INFOCOM
2009
IEEE
16 years 29 days ago
2009
IEEE
Abstract—We propose a novel search mechanism for unstructured p2p networks, and show that it is both scalable, i.e., it leads to a bounded query traffic load per peer as the pee...
150
click to vote
ICHIT
2009
Springer
16 years 26 days ago
2009
Springer
Discovering the AS paths between two ASes are invaluable for a wide area of network research and application activities. The traditional techniques for path discovery require dire...
174
click to vote
ICCCN
2008
IEEE
16 years 23 days ago
2008
IEEE
—Observing that simplicity implies efficiency and scalability, this paper proposes a position-based deployment and routing strategy, and then gives a concrete approach under this...
148
click to vote
ICMCS
2007
IEEE
16 years 19 days ago
2007
IEEE
In this paper, we present a graph-theoretic framework for provisioning overlay network based multimedia distribution services to a diverse set of receivers. Considering resource l...