Sciweavers

2020 search results - page 308 / 404
» Speeding up Slicing
Sort
View
PVLDB
2010
89views more  PVLDB 2010»
13 years 7 months ago
Transforming Range Queries To Equivalent Box Queries To Optimize Page Access
Range queries based on L1 distance are a common type of queries in multimedia databases containing feature vectors. We propose a novel approach that transforms the feature space i...
Sakti Pramanik, Alok Watve, Chad R. Meiners, Alex ...
SIGOPS
2010
127views more  SIGOPS 2010»
13 years 7 months ago
Optimizing information flow in the gossip objects platform
Gossip-based protocols are commonly used for diffusing information in large-scale distributed applications. GO (Gossip Objects) is a per-node gossip platform that we developed in...
Ymir Vigfusson, Ken Birman, Qi Huang, Deepak P. Na...
SISAP
2010
IEEE
159views Data Mining» more  SISAP 2010»
13 years 7 months ago
CP-index: using clustering and pivots for indexing non-metric spaces
Most multimedia information retrieval systems use an indexing scheme to speed up similarity search. The index aims to discard large portions of the data collection at query time. ...
Victor Sepulveda, Benjamin Bustos
SWAT
2010
Springer
242views Algorithms» more  SWAT 2010»
13 years 7 months ago
Minimizing the Diameter of a Network Using Shortcut Edges
We study the problem of minimizing the diameter of a graph by adding k shortcut edges, for speeding up communication in an existing network design. We develop constant-factor appro...
Erik D. Demaine, Morteza Zadimoghaddam
TC
2010
13 years 7 months ago
Dynamic Multiway Segment Tree for IP Lookups and the Fast Pipelined Search Engine
—A dynamic multiway segment tree (DMST) is proposed for IP lookups in this paper. DMST is designed for dynamic routing tables that can dynamically insert and delete prefixes. DMS...
Yeim-Kuan Chang, Yung-Chieh Lin, Cheng-Chien Su