Sciweavers

1110 search results - page 135 / 222
» Clustering with the Connectivity Kernel
Sort
View
TIT
2002
126views more  TIT 2002»
13 years 8 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
IWPEC
2009
Springer
14 years 3 months ago
On the Directed Degree-Preserving Spanning Tree Problem
In this paper we initiate a systematic study of the Reduced Degree Spanning Tree problem, where given a digraph D and a nonnegative integer k, the goal is to construct a spanning o...
Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh,...
HPDC
2002
IEEE
14 years 1 months ago
Dynamic Right-Sizing in FTP (drsFTP): Enhancing Grid Performance in User-Space
With the advent of computational grids, networking performance over the wide-area network (WAN) has become a critical component in the grid infrastructure. Unfortunately, many hig...
Mark K. Gardner, Wu-chun Feng, Mike Fisk
SGP
2004
13 years 11 months ago
A Remeshing Approach to Multiresolution Modeling
Providing a thorough mathematical foundation, multiresolution modeling is the standard approach for global surface deformations that preserve fine surface details in an intuitive ...
Mario Botsch, Leif Kobbelt
RSA
2010
98views more  RSA 2010»
13 years 7 months ago
Merging percolation on Zd and classical random graphs: Phase transition
: We study a random graph model which is a superposition of bond percolation on Zd with parameter p, and a classical random graph G(n, c/n). We show that this model, being a homoge...
Tatyana S. Turova, Thomas Vallier