5153 search results - page 230 / 1031 » Introduction to Randomized Algorithms |
170
click to vote
PAMI
2010
14 years 10 months ago
2010
We present a new method for blind document bleed through removal based on separate Markov Random Field (MRF) regularization for the recto and for the verso side, where separate pri...
164
click to vote
MMM
2011
Springer
14 years 7 months ago
2011
Springer
Abstract. Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree...
110
click to vote
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...
119
click to vote
ICML
2010
IEEE
15 years 4 months ago
2010
IEEE
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
138
Voted
ICIP
2008
IEEE
16 years 5 months ago
2008
IEEE
Hashes can be used to provide authentication of multimedia contents. In the case of images, a hash can be used to detect whether the data has been modified in an illegitimate way....