Sciweavers

868 search results - page 24 / 174
» A general compression algorithm that supports fast searching
Sort
View
GECCO
2008
Springer
135views Optimization» more  GECCO 2008»
13 years 8 months ago
Agent-based support for interactive search in conceptual software engineering design
While recent attempts to search a conceptual software engineering design search space with multi-objective evolutionary algorithms have yielded promising results, the practical ap...
Christopher L. Simons, Ian C. Parmee
ECUMN
2004
Springer
13 years 11 months ago
Fast Handoff Algorithm Using Access Points with Dual RF Modules
With the spread of portable computers, mobile users rapidly increase and have growing interests in wireless LAN (WLAN). However, when a mobile node (MN) moves, handoff can frequent...
Chun-Su Park, Hye-Soo Kim, Sang-Hee Park, Kyunghun...
ICDE
1998
IEEE
124views Database» more  ICDE 1998»
13 years 12 months ago
Compressing Relations and Indexes
We propose a new compression algorithm that is tailored to database applications. It can be applied to a collection of records, and is especially e ective for records with many lo...
Jonathan Goldstein, Raghu Ramakrishnan, Uri Shaft
CIKM
2008
Springer
13 years 9 months ago
CE2: towards a large scale hybrid search engine with integrated ranking support
The Web contains a large amount of documents and increasingly, also semantic data in the form of RDF triples. Many of these triples are annotations that are associated with docume...
Haofen Wang, Thanh Tran, Chang Liu
CIKM
2009
Springer
14 years 2 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...