5580 search results - page 278 / 1116 » Randomized priority algorithms |
218
click to vote
PAMI
2010
15 years 1 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...
219
click to vote
MMM
2011
Springer
14 years 10 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...
222
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
Abstract—Despite recent efforts to characterize complex networks such as citation graphs or online social networks (OSNs), little attention has been given to developing tools tha...
145
Voted
ICALP
2005
Springer
15 years 12 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...
152
click to vote
ICML
2010
IEEE
15 years 7 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...