Sciweavers

803 search results - page 140 / 161
» Independence in Direct-Product Graphs
Sort
View
SODA
2004
ACM
144views Algorithms» more  SODA 2004»
13 years 9 months ago
Covering minimum spanning trees of random subgraphs
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
Michel X. Goemans, Jan Vondrák
CLIN
2000
13 years 9 months ago
Syntactic Annotation for the Spoken Dutch Corpus Project (CGN)
Of the ten million words of contemporary standard Dutch in the Spoken Dutch Corpus (Corpus Gesproken Nederlands, CGN), a selection of one million words of natural spoken language ...
Heleen Hoekstra, Michael Moortgat, Ineke Schuurman...
AAAI
1996
13 years 9 months ago
Robot Navigation Using Image Sequences
We describe a framework for robot navigation that exploits the continuity of image sequences. Tracked visual features both guide the robot and provide predictive information about...
Christopher Rasmussen, Gregory D. Hager
COMBINATORICA
2008
84views more  COMBINATORICA 2008»
13 years 8 months ago
Parity check matrices and product representations of squares
Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are...
Assaf Naor, Jacques Verstraëte
AMC
2006
100views more  AMC 2006»
13 years 8 months ago
Reliability evaluation of multi-component cold-standby redundant systems
A new methodology for the reliability evaluation of an l-dissimilar-unit non-repairable cold-standby redundant system is introduced in this paper. Each unit is composed of a numbe...
Amir Azaron, Hideki Katagiri, Kosuke Kato, Masatos...