Sciweavers

2498 search results - page 365 / 500
» Algorithms for the Topological Watershed
Sort
View
MSWIM
2006
ACM
14 years 2 months ago
The power of choice in random walks: an empirical study
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
Chen Avin, Bhaskar Krishnamachari
ICAS
2005
IEEE
85views Robotics» more  ICAS 2005»
14 years 1 months ago
Supporting Consistency Management in Dynamic Content Distribution Overlays
Content Distribution Overlays improves end-user performance by replicating Web contents on a group of geographically distributed sites interconnected over the Internet. However, w...
Zhou Su, Jiro Katto, Yasuhiko Yasuda
ICMCS
2005
IEEE
106views Multimedia» more  ICMCS 2005»
14 years 1 months ago
Media Aware Routing in Large Scale Networks with Overlay
This paper presents a new routing strategy, that selects the best network paths in an overlay network, in order to minimize the distortion perceived by the end user. We first pro...
Dan Jurca, Sanja Petrovic, Pascal Frossard
SRDS
2005
IEEE
14 years 1 months ago
Distributed Construction of a Fault-Tolerant Network from a Tree
We present an algorithm by which nodes arranged in a tree, with each node initially knowing only its parent and children, can construct a fault-tolerant communication structure (a...
Michael K. Reiter, Asad Samar, Chenxi Wang
VISUALIZATION
2005
IEEE
14 years 1 months ago
Interactive Rendering of Large Unstructured Grids Using Dynamic Level-of-Detail
We describe a new dynamic level-of-detail (LOD) technique that allows real-time rendering of large tetrahedral meshes. Unlike approaches that require hierarchies of tetrahedra, ou...
Steven P. Callahan, João Luiz Dihl Comba, P...