390 search results - page 29 / 78 » Computing shortest paths for any number of hops |
113
Voted
ISCC
2005
IEEE
15 years 7 months ago
2005
IEEE
We propose routing schemes that optimize the average number of hops for lookup requests in Peer–to–Peer (P2P) systems without adding any overhead to the system. Our work is in...
125
click to vote
DASFAA
2010
IEEE
15 years 7 months ago
2010
IEEE
Given a set of query points, a dynamic skyline query reports all data points that are not dominated by other data points according to the distances between data points and query po...
136
Voted
EMMCVPR
2007
Springer
15 years 8 months ago
2007
Springer
Most of the traditional methods for shape classification are based on contour. They often encounter difficulties when dealing with classes that have large nonlinear variability, es...
121
Voted
ARC
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Monte Carlo simulation is one of the most widely used techniques for computationally intensive simulations in mathematical analysis and modeling. A multivariate Gaussian ...
135
click to vote
INFOCOM
2002
IEEE
15 years 6 months ago
2002
IEEE
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...