Sciweavers

171 search results - page 27 / 35
» Relating Clustering Stability to Properties of Cluster Bound...
Sort
View
EUROPAR
2009
Springer
13 years 5 months ago
A Least-Resistance Path in Reasoning about Unstructured Overlay Networks
Unstructured overlay networks for peer-to-peer applications combined with stochastic algorithms for clustering and resource location are attractive due to low-maintenance costs and...
Giorgos Georgiadis, Marina Papatriantafilou
TIT
2002
126views more  TIT 2002»
13 years 7 months ago
Two-dimensional interleaving schemes with repetitions: Constructions and bounds
Abstract--Two-dimensional interleaving schemes with repetitions are considered. These schemes are required for the correction of two-dimensional bursts (or clusters) of errors in a...
Tuvi Etzion, Alexander Vardy
CCGRID
2008
IEEE
14 years 2 months ago
A Stable Broadcast Algorithm
—Distributing large data to many nodes, known as a broadcast or a multicast, is an important operation in parallel and distributed computing. Most previous broadcast algorithms e...
Kei Takahashi, Hideo Saito, Takeshi Shibata, Kenji...
ICDE
2010
IEEE
227views Database» more  ICDE 2010»
14 years 2 months ago
Incorporating partitioning and parallel plans into the SCOPE optimizer
— Massive data analysis on large clusters presents new opportunities and challenges for query optimization. Data partitioning is crucial to performance in this environment. Howev...
Jingren Zhou, Per-Åke Larson, Ronnie Chaiken
SIGGRAPH
2003
ACM
14 years 1 months ago
Interactive rendering of translucent deformable objects
Realistic rendering of materials such as milk, fruits, wax, marble, and so on, requires the simulation of subsurface scattering of light. This paper presents an algorithm for plau...
Tom Mertens, Jan Kautz, Philippe Bekaert, Hans-Pet...