Sciweavers

526 search results - page 103 / 106
» Increments of Random Partitions
Sort
View
NIPS
2004
13 years 8 months ago
Hierarchical Eigensolver for Transition Matrices in Spectral Methods
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
Chakra Chennubhotla, Allan D. Jepson
NIPS
1998
13 years 8 months ago
An Entropic Estimator for Structure Discovery
We introduce a novel framework for simultaneous structure and parameter learning in hidden-variable conditional probability models, based on an entropic prior and a solution for i...
Matthew Brand
AAAI
1996
13 years 8 months ago
Improved Limited Discrepancy Search
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
Richard E. Korf
BMCBI
2008
135views more  BMCBI 2008»
13 years 7 months ago
Ab-origin: an enhanced tool to identify the sourcing gene segments in germline for rearranged antibodies
Background: In the adaptive immune system, variable regions of immunoglobulin (IG) are encoded by random recombination of variable (V), diversity (D), and joining (J) gene segment...
Xiaojing Wang, Di Wu, SiYuan Zheng, Jing Sun, Lin ...
CORR
2010
Springer
190views Education» more  CORR 2010»
13 years 7 months ago
Overlap properties of geometric expanders
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
Jacob Fox, Mikhail Gromov, Vincent Lafforgue, Assa...