381 search results - page 57 / 77 » Approximate Matching of Hierarchical Data Using pq-Grams |
INFOCOM
1998
IEEE
13 years 12 months ago
1998
IEEE
We present the Informed-Source Coding-On-Demand (ISCOD) approach for efficiently supplying non-identical data from a central server to multiple caching clients through a broadcast ...
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
Matching patches between two images, also known as computing nearest-neighbor fields, has been proven a useful technique in various computer vision/graphics algorithms. But this ...
CGF
2000
13 years 7 months ago
2000
We present a technique for accelerating the rendering of high depth-complexity scenes. In a preprocessing stage, we approximate the input model with a hierarchical data structure ...
EUROSYS
2006
ACM
14 years 4 months ago
2006
ACM
Building content-based search tools for feature-rich data has been a challenging problem because feature-rich data such as audio recordings, digital images, and sensor data are in...
STOC
2005
ACM
14 years 1 months ago
2005
ACM
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...