2168 search results - page 282 / 434 » Randomized Algorithms and Complexity Theory |
137
Voted
JODL
2006
15 years 3 months ago
2006
Abstract Scalable storage architectures enable digital libraries and archives for the addition or removal of storage devices to increase storage capacity and bandwidth or retire ol...
113
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
Conditional Random Fields (CRFs) have proven to perform well on natural language processing tasks like name transliteration, concept tagging or grapheme-to-phoneme (g2p) conversio...
110
click to vote
SODA
2010
ACM
16 years 27 days ago
2010
ACM
A monotone distribution P over a (partially) ordered domain assigns higher probability to y than to x if y x in the order. We study several natural problems concerning testing pr...
138
Voted
CISS
2008
IEEE
15 years 10 months ago
2008
IEEE
— We propose an implementable new universal lossy source coding algorithm. The new algorithm utilizes two wellknown tools from statistical physics and computer science: Gibbs sam...
114
Voted
UAI
2004
15 years 4 months ago
2004
As real-world Bayesian networks continue to grow larger and more complex, it is important to investigate the possibilities for improving the performance of existing algorithms of ...