Sciweavers

194 search results - page 12 / 39
» Computing Distance Histograms Efficiently in Scientific Data...
Sort
View
ICDE
2005
IEEE
139views Database» more  ICDE 2005»
14 years 10 months ago
Compressing Bitmap Indices by Data Reorganization
Many scientific applications generate massive volumes of data through observations or computer simulations, bringing up the need for effective indexing methods for efficient stora...
Ali Pinar, Tao Tao, Hakan Ferhatosmanoglu
ICPR
2010
IEEE
13 years 7 months ago
An Efficient Method for Offline Text Independent Writer Identification
This paper proposes, an efficient method for text independent writer identification using a codebook. The occurrence histogram of the shapes in the codebook is used to create a fea...
Golnaz Ghiasi, Reza Safabakhsh
GIS
2002
ACM
13 years 8 months ago
A road network embedding technique for k-nearest neighbor search in moving object databases
A very important class of queries in GIS applications is the class of K-Nearest Neighbor queries. Most of the current studies on the K-Nearest Neighbor queries utilize spatial ind...
Cyrus Shahabi, Mohammad R. Kolahdouzan, Mehdi Shar...
CVPR
2004
IEEE
14 years 11 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Kristen Grauman, Trevor Darrell
ICDE
2004
IEEE
259views Database» more  ICDE 2004»
14 years 10 months ago
Querying about the Past, the Present, and the Future in Spatio-Temporal
Moving objects (e.g., vehicles in road networks) continuously generate large amounts of spatio-temporal information in the form of data streams. Efficient management of such strea...
Jimeng Sun, Dimitris Papadias, Yufei Tao, Bin Liu