Sciweavers

3319 search results - page 555 / 664
» The topology of dark networks
Sort
View
PDPTA
2007
15 years 7 months ago
LEGS: A WSRF Service to Estimate Latency Between Arbitrary Hosts on the Internet
: The ability to estimate the communication latency between arbitrary hosts on the Internet would enable the distributed computing applications to find the closest server or to fin...
R. Vijayprasanth, R. Kavithaa, Rajkumar Kettimuthu
IVEVA
2004
15 years 7 months ago
Giving Embodied Agents a Grid-Boost
Grid technology has been widely used for large-scale computational problems, but it also provides a framework for running a big number of smallsized processes. Moreover, these proc...
José A. Pérez, Carlos Delgado-Mata, ...
NIPS
2004
15 years 7 months ago
Newscast EM
We propose a gossip-based distributed algorithm for Gaussian mixture learning, Newscast EM. The algorithm operates on network topologies where each node observes a local quantity ...
Wojtek Kowalczyk, Nikos A. Vlassis
SIP
2001
15 years 7 months ago
Marching ridges
Marching Ridges is an algorithm for finding ridges of measurement functions defined for images, in which the ridges are defined as level sets of first derivatives of the measureme...
Jacob D. Furst, Stephen M. Pizer
SODA
2004
ACM
120views Algorithms» more  SODA 2004»
15 years 7 months ago
Optimal routing in Chord
We propose optimal routing algorithms for Chord [1], a popular topology for routing in peer-to-peer networks. Chord is an undirected graph on 2b nodes arranged in a circle, with e...
Prasanna Ganesan, Gurmeet Singh Manku