2127 search results - page 202 / 426 » Computing large matchings fast |
129
Voted
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
141
click to vote
ACCV
2006
Springer
15 years 10 months ago
2006
Springer
We present a fast and robust method for moving object tracking directly in the compressed domain using features available in MPEG videos. DCT domain background subtraction in Y pla...
110
Voted
DIS
2006
Springer
15 years 8 months ago
2006
Springer
This paper introduces a new family of string classifiers based on local relatedness. We use three types of local relatedness measurements, namely, longest common substrings (LCStr&...
126
click to vote
NOSSDAV
1995
Springer
15 years 8 months ago
1995
Springer
Abstract. We introduce the concept of Dynamic Rate Shaping, a technique to adapt the rate ofcompressed video bitstreams MPEG-1, MPEG2, H.261, as well as JPEG to dynamically varyi...
128
Voted
FOCS
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract--The generalized nested dissection method, developed by Lipton, Rose, and Tarjan, is a seminal method for solving a linear system Ax = b where A is a symmetric positive de...