Sciweavers

1449 search results - page 46 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
ECIR
2010
Springer
14 years 10 months ago
Maximum Margin Ranking Algorithms for Information Retrieval
Abstract. Machine learning ranking methods are increasingly applied to ranking tasks in information retrieval (IR). However ranking tasks in IR often differ from standard ranking t...
Shivani Agarwal, Michael Collins
96
Voted
CORR
2008
Springer
129views Education» more  CORR 2008»
15 years 18 days ago
A polytime proof of correctness of the Rabin-Miller algorithm from Fermat's little theorem
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...
Grzegorz Herman, Michael Soltys
SIAMIS
2008
279views more  SIAMIS 2008»
15 years 13 days ago
A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
We propose, analyze and test an alternating minimization algorithm for recovering images from blurry and noisy observations with total variation (TV) regularization. This algorith...
Yilun Wang, Junfeng Yang, Wotao Yin, Yin Zhang
DISOPT
2007
155views more  DISOPT 2007»
15 years 15 days ago
Linear-programming design and analysis of fast algorithms for Max 2-CSP
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...
Alexander D. Scott, Gregory B. Sorkin
102
Voted
NIPS
2007
15 years 1 months ago
Local Algorithms for Approximate Inference in Minor-Excluded Graphs
We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...
Kyomin Jung, Devavrat Shah