2654 search results - page 307 / 531 » On Pairing Inversion Problems |
254
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
Recent years have witnessed the growing popularity of hashing in large-scale vision problems. It has been shown that the hashing quality could be boosted by leveraging supervised ...
180
Voted
PKC
1999
Springer
15 years 11 months ago
1999
Springer
One of the key directions in complexity theory which has also filtered through to cryptographic research, is the effort to classify related but seemingly distinct notions. Separa...
176
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
176
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...
215
click to vote
ACCV
2006
Springer
16 years 19 days ago
2006
Springer
We describe a method for computing a dense estimate of motion and disparity, given a stereo video sequence containing moving non-rigid objects. In contrast to previous approaches, ...