Sciweavers

1945 search results - page 82 / 389
» Speeding up Serpent
Sort
View
SISAP
2010
IEEE
159views Data Mining» more  SISAP 2010»
14 years 9 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»
14 years 9 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
14 years 9 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
TMC
2010
109views more  TMC 2010»
14 years 9 months ago
Uncertainty Modeling and Reduction in MANETs
—Evaluating and quantifying trust stimulates collaboration in mobile ad hoc networks (MANETs). Many existing reputation systems sharply divide the trust value into right or wrong...
Feng Li, Jie Wu
WAIM
2010
Springer
14 years 9 months ago
Query Processing with Materialized Views in a Traceable P2P Record Exchange Framework
Materialized views which are derived from base relations and stored in the database are often used to speed up query processing. In this paper, we leverage them in a traceable peer...
Fengrong Li, Yoshiharu Ishikawa