531 search results - page 19 / 107 » A Better Algorithm for Random k-SAT |
STACS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
SIGIR
2009
ACM
14 years 2 months ago
2009
ACM
Recent work in supervised learning of term-based retrieval models has shown significantly improved accuracy can often be achieved via better model estimation [2, 10, 11, 17]. In ...
ICASSP
2008
IEEE
14 years 2 months ago
2008
IEEE
This paper shows how to improve Hidden Conditional Random Fields (HCRFs) for phone classification by applying various speaker adaptation techniques. These include Maximum A Poste...
AAAI
2008
13 years 10 months ago
2008
Conditional random field (CRF) is a popular graphical model for sequence labeling. The flexibility of CRF poses significant computational challenges for training. Using existing o...
WEA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Extensions of the randomized tournaments techniques introduced in [6, 7] to approximate solutions of 1-median and diameter computation of finite subsets of general metri...