Sciweavers

1429 search results - page 207 / 286
» Efficient processing of XPath queries using indexes
Sort
View
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
14 years 9 months ago
Sharing aggregate computation for distributed queries
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
Ryan Huebsch, Minos N. Garofalakis, Joseph M. Hell...
ICIP
2006
IEEE
14 years 11 months ago
Content-Adaptive Video Summarization Combining Queueing and Clustering
This paper presents an efficient three-step algorithm to compute key frames for summarization and indexing of digital videos. In the preprocessing step, we remove the video frames...
Tiecheng Liu, Ravi Katpelly
DSN
2009
IEEE
14 years 1 months ago
Efficient resource management on template-based web servers
The most commonly used request processing model in multithreaded web servers is thread-per-request, in which an individual thread is bound to serve each web request. However, with...
Eli Courtwright, Chuan Yue, Haining Wang
PAMI
2008
152views more  PAMI 2008»
13 years 9 months ago
K-Nearest Neighbor Finding Using MaxNearestDist
Abstract-Similarity searching often reduces to finding the k nearest neighbors to a query object. Finding the k nearest neighbors is achieved by applying either a depth-first or a ...
Hanan Samet
TIP
2010
90views more  TIP 2010»
13 years 4 months ago
Fast Query for Exemplar-Based Image Completion
In this paper, we present a fast algorithm for filling unknown regions in an image using the strategy of exemplarmatching. Unlike the original exemplar-based method using exhaustiv...
Tsz-Ho Kwok, Hoi Sheung, Charlie C. L. Wang