1731 search results - page 43 / 347 » Maximum likelihood analysis of algorithms and data structure... |
137
click to vote
JMLR
2006
15 years 3 months ago
2006
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
126
click to vote
KDD
2004
ACM
16 years 4 months ago
2004
ACM
Subspace learning approaches have attracted much attention in academia recently. However, the classical batch algorithms no longer satisfy the applications on streaming data or la...
112
click to vote
KDD
2001
ACM
16 years 4 months ago
2001
ACM
Skewed distributions appear very often in practice. Unfortunately, the traditional Zipf distribution often fails to model them well. In this paper, we propose a new probability di...
136
Voted
BMCBI
2008
15 years 3 months ago
2008
Background: Tight clustering arose recently from a desire to obtain tighter and potentially more informative clusters in gene expression studies. Scattered genes with relatively l...
112
Voted
ICASSP
2008
IEEE
15 years 10 months ago
2008
IEEE
This paper presents a hierarchical lane detection system with the ability to deal with both structured and unstructured roads. The proposed system classifies the environment first...