Sciweavers

172 search results - page 9 / 35
» On the cost of searching signature trees
Sort
View
TKDE
2008
132views more  TKDE 2008»
13 years 7 months ago
Distributed Suffix Tree Overlay for Peer-to-Peer Search
Establishing an appropriate semantic overlay on peer-to-peer (P2P) networks to obtain both semantic ability and scalability is a challenge. Current DHT-based P2P networks are limit...
Hai Zhuge, Liang Feng
DEXA
2010
Springer
187views Database» more  DEXA 2010»
13 years 5 months ago
Pivot Selection Method for Optimizing both Pruning and Balancing in Metric Space Indexes
We researched to try to find a way to reduce the cost of nearest neighbor searches in metric spaces. Many similarity search indexes recursively divide a region into subregions by u...
Hisashi Kurasawa, Daiji Fukagawa, Atsuhiro Takasu,...
ATAL
2009
Springer
14 years 2 months ago
Directed soft arc consistency in pseudo trees
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
Toshihiro Matsui, Marius-Calin Silaghi, Katsutoshi...
ICVS
2009
Springer
14 years 2 months ago
Visual Registration Method for a Low Cost Robot
Abstract— An autonomous mobile robot must face the correspondence or data association problem in order to carry out tasks like place recognition or unknown environment mapping. I...
David Aldavert, Arnau Ramisa, Ricardo Toledo, Ramo...
TC
2010
13 years 5 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