244 search results - page 27 / 49 » Fast Set Intersection in Memory |
VISSYM
2003
13 years 11 months ago
2003
We present a fast method that adaptively approximates large-scale functional scattered data sets with hierarchical B-splines. The scheme is memory efficient, easy to implement an...
DAC
2007
ACM
14 years 11 months ago
2007
ACM
Pattern matching is essential to a wide range of applications such as network intrusion detection, virus scanning, etc. Pattern matching algorithms normally rely on state machines...
EDBT
2006
ACM
14 years 1 months ago
2006
ACM
Utilizing spatial index structures on secondary memory for nearest neighbor search in high-dimensional data spaces has been the subject of much research. With the potential to host...
AMDO
2010
Springer
14 years 15 days ago
2010
Springer
Abstract. In this paper, we present a novel, fast, resolution-independent silhouette area-based matching approach. We approximate the silhouette area by a small set of axis-aligned...
ICCV
2009
IEEE
15 years 3 months ago
2009
IEEE
In this paper we aim at reconstructing 3D scenes from images
with unknown focal lengths downloaded from photosharing
websites such as Flickr. First we provide a minimal
solution...