Sciweavers

1313 search results - page 197 / 263
» Data Discretization Unification
Sort
View
TIT
2011
169views more  TIT 2011»
13 years 3 months ago
Network Coding Theory Via Commutative Algebra
—The fundamental result of linear network coding asserts the existence of optimal codes over acyclic networks when the symbol field is sufficiently large. The restriction to just...
Shuo-Yen Robert Li, Qifu Tyler Sun
JMLR
2010
135views more  JMLR 2010»
13 years 3 months ago
An Exponential Model for Infinite Rankings
This paper presents a statistical model for expressing preferences through rankings, when the number of alternatives (items to rank) is large. A human ranker will then typically r...
Marina Meila, Le Bao
JMLR
2010
137views more  JMLR 2010»
13 years 3 months ago
Covariance in Unsupervised Learning of Probabilistic Grammars
Probabilistic grammars offer great flexibility in modeling discrete sequential data like natural language text. Their symbolic component is amenable to inspection by humans, while...
Shay B. Cohen, Noah A. Smith
JMLR
2010
111views more  JMLR 2010»
13 years 3 months ago
Single versus Multiple Sorting in All Pairs Similarity Search
To save memory and improve speed, vectorial data such as images and signals are often represented as strings of discrete symbols (i.e., sketches). Chariker (2002) proposed a fast ...
Yasuo Tabei, Takeaki Uno, Masashi Sugiyama, Koji T...
CORR
2010
Springer
121views Education» more  CORR 2010»
13 years 9 months ago
Symmetric Allocations for Distributed Storage
We consider the problem of optimally allocating a given total storage budget in a distributed storage system. A source has a data object which it can code and store over a set of s...
Derek Leong, Alexandros G. Dimakis, Tracey Ho