10997 search results - page 106 / 2200 » On the Structure of Complete Sets |
159
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Spectral clustering is one of the most widely used techniques for extracting the underlying global structure of a data set. Compressed sensing and matrix completion have emerged a...
191
click to vote
TIT
2010
15 years 23 days ago
2010
The class of low-density parity-check (LDPC) codes is attractive, since such codes can be decoded using practical message-passing algorithms, and their performance is known to app...
159
Voted
CGI
2004
IEEE
15 years 9 months ago
2004
IEEE
In this paper we articulate a new modeling paradigm for both local and global editing on complicated point set surfaces of arbitrary topology. In essence, the proposed technique l...
178
click to vote
CORR
2012
Springer
14 years 1 months ago
2012
Springer
The problem of learning the structure of Bayesian networks from complete discrete data with a limit on parent set size is considered. Learning is cast explicitly as an optimisatio...
160
click to vote
ITP
2010
15 years 10 months ago
2010
Abstract. We present a compiler for definitions made by pattern matching on inductive families in the Coq system. It allows to write structured, recursive dependently-typed functi...