Sciweavers

272 search results - page 45 / 55
» The compressed permuterm index
Sort
View
92
Voted
VISUALIZATION
1996
IEEE
15 years 3 months ago
Real-time Slicing of Data Space
This can be a costly operation. When the data is arranged according to its three-dimensional coordinates, calculating the contour surfaces requires examining each data cell. Avoidi...
Roger Crawfis
111
Voted
FOCS
2009
IEEE
15 years 3 months ago
Space-Efficient Framework for Top-k String Retrieval Problems
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 2 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
CVPR
2009
IEEE
16 years 6 months ago
From Structure-from-Motion Point Clouds to Fast Location Recognition
Efficient view registration with respect to a given 3D reconstruction has many applications like inside-out tracking in indoor and outdoor environments, and geo-locating images ...
Arnold Irschara (Graz University of Technology), C...
ICIP
2004
IEEE
16 years 1 months ago
Robust perceptual image hashing using feature points
Perceptual image hashing maps an image to a fixed length binary string based on the image's appearance to the human eye, and has applications in image indexing, authenticatio...
Vishal Monga, Brian L. Evans