Sciweavers

304 search results - page 14 / 61
» Parallel and Distributed Compressed Indexes
Sort
View
ICCS
2007
Springer
14 years 2 months ago
Searching and Updating Metric Space Databases Using the Parallel EGNAT
Abstract. The Evolutionary Geometric Near-neighbor Access Tree (EGNAT) is a recently proposed data structure that is suitable for indexing large collections of complex objects. It ...
Mauricio Marín, Roberto Uribe, Ricardo J. B...
ICDCS
2012
IEEE
11 years 11 months ago
Scaling Down Off-the-Shelf Data Compression: Backwards-Compatible Fine-Grain Mixing
—Pu and Singaravelu presented Fine-Grain Mixing, an adaptive compression system which aimed to maximize CPU and network utilization simultaneously by splitting a network stream i...
Michael Gray, Peter Peterson, Peter L. Reiher
IPPS
2007
IEEE
14 years 2 months ago
Code Compression and Decompression for Instruction Cell Based Reconfigurable Systems
Code compression has been applied to embedded systems to minimize the silicon area utilized for program memories, and lower the power consumption. More recently, it has become a n...
Nazish Aslam, Mark Milward, Ioannis Nousias, Tughr...
SKG
2006
IEEE
14 years 2 months ago
An Ontology Based Local Index in P2P Networks
Peer-to-peer networks (P2P) are beginning to form the infrastructure of future applications. One of the problems with unstructured P2P networks is their scalability limitation. Th...
Habib Rostami, Jafar Habibi, Hassan Abolhassani, M...
CIKM
2010
Springer
13 years 7 months ago
Document allocation policies for selective searching of distributed indexes
Indexes for large collections are often divided into shards that are distributed across multiple computers and searched in parallel to provide rapid interactive search. Typically,...
Anagha Kulkarni, Jamie Callan