Sciweavers

475 search results - page 17 / 95
» Z3-Connectivity with Independent Number 2
Sort
View
ARSCOM
2008
117views more  ARSCOM 2008»
13 years 10 months ago
Subset Counting in Trees
Various enumeration problems for classes of simply generated families of trees have been the object of investigation in the past. We mention the enumeration of independent subsets,...
Stephan G. Wagner
HPCC
2007
Springer
14 years 4 months ago
A Block JRS Algorithm for Highly Parallel Computation of SVDs
This paper presents a new algorithm for computing the singular value decomposition (SVD) on multilevel memory hierarchy architectures. This algorithm is based on one-sided JRS iter...
Mostafa I. Soliman, Sanguthevar Rajasekaran, Reda ...
ICDE
1997
IEEE
130views Database» more  ICDE 1997»
14 years 11 months ago
High-Dimensional Similarity Joins
Many emerging data mining applications require a similarity join between points in a high-dimensional domain. We present a new algorithm that utilizes a new index structure, calle...
Kyuseok Shim, Ramakrishnan Srikant, Rakesh Agrawal
TCOM
2011
94views more  TCOM 2011»
13 years 4 months ago
Protection Against Link Errors and Failures Using Network Coding
—We propose a network-coding based scheme to protect multiple bidirectional unicast connections against adversarial errors and failures in a network. The end nodes of the bidirec...
Shizheng Li, Aditya Ramamoorthy
CORR
2011
Springer
148views Education» more  CORR 2011»
13 years 4 months ago
On Stabilization in Herman's Algorithm
Herman’s algorithm is a synchronous randomized protocol for achieving self-stabilization in a token ring consisting of N processes. The interaction of tokens makes the dynamics o...
Stefan Kiefer, Andrzej S. Murawski, Joël Ouak...