185 search results - page 3 / 37 » Constructions of Grassmannian Simplices |
CORR
2007
Springer
13 years 6 months ago
2007
Springer
Abstract—The problem of error-control in random linear network coding is considered. A “noncoherent” or “channel oblivious” model is assumed where neither transmitter nor...
JACM
2006
13 years 6 months ago
2006
Suffix trees and suffix arrays are widely used and largely interchangeable index structures on strings and sequences. Practitioners prefer suffix arrays due to their simplicity an...
ISMVL
2010
IEEE
13 years 11 months ago
2010
IEEE
—Every probability on many-valued events (a state on a finitely-generated free MV-algebras) is uniquely represented by refining finitely-supported probabilities across all Sch...
INFOCOM
2006
IEEE
14 years 9 days ago
2006
IEEE
— Unstructured p2p and overlay network applications often require that a random graph be constructed, and that some form of random node selection take place over that graph. A ke...
TVCG
2012
11 years 8 months ago
2012
—The Reeb graph of a scalar function represents the evolution of the topology of its level sets. This paper describes a near-optimal output-sensitive algorithm for computing the ...