Sciweavers

7228 search results - page 78 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
ICALP
2004
Springer
15 years 8 months ago
Sublinear-Time Approximation for Clustering Via Random Sampling
Abstract. In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median, min-sum kclustering, and balanced k-medi...
Artur Czumaj, Christian Sohler
ICCV
2009
IEEE
1048views Computer Vision» more  ICCV 2009»
16 years 8 months ago
Face Recognition With Contiguous Occlusion Using Markov Random Fields
Partially occluded faces are common in many applications of face recognition. While algorithms based on sparse representation have demonstrated promising results, they achieve t...
Zihan Zhou, Andrew Wagner, Hossein Mobahi, John Wr...
RECOMB
2004
Springer
16 years 3 months ago
A random graph approach to NMR sequential assignment
Nuclear magnetic resonance (NMR) spectroscopy allows scientists to study protein structure, dynamics and interactions in solution. A necessary first step for such applications is ...
Chris Bailey-Kellogg, Sheetal Chainraj, Gopal Pand...
ACL
2010
15 years 1 months ago
Conditional Random Fields for Word Hyphenation
Finding allowable places in words to insert hyphens is an important practical problem. The algorithm that is used most often nowadays has remained essentially unchanged for 25 yea...
Nikolaos Trogkanis, Charles Elkan
APPROX
2006
Springer
121views Algorithms» more  APPROX 2006»
15 years 7 months ago
A Randomized Solver for Linear Systems with Exponential Convergence
Abstract. The Kaczmarz method for solving linear systems of equations Ax = b is an iterative algorithm that has found many applications ranging from computer tomography to digital ...
Thomas Strohmer, Roman Vershynin