Sciweavers

3223 search results - page 130 / 645
» The Scaling of Search Cost
Sort
View
ICDE
2006
IEEE
177views Database» more  ICDE 2006»
16 years 7 months ago
Searching Substructures with Superimposed Distance
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
Xifeng Yan, Feida Zhu, Jiawei Han, Philip S. Yu
IJCAI
2007
15 years 7 months ago
Edge Partitioning in External-Memory Graph Search
There is currently much interest in using external memory, such as disk storage, to scale up graph-search algorithms. Recent work shows that the local structure of a graph can be ...
Rong Zhou, Eric A. Hansen
CHI
2002
ACM
16 years 6 months ago
Hierarchical faceted metadata in site search interfaces
One of the most pressing usability issues in the design of large web sites is that of the organization of search results. A previous study on a moderate-sized web site indicated t...
Jennifer English, Marti A. Hearst, Rashmi R. Sinha...
ICASSP
2011
IEEE
15 years 3 months ago
Searching in one billion vectors: re-rank with source coding
Recent indexing techniques inspired by source coding have been shown successful to index billions of high-dimensional vectors in memory. In this paper, we propose an approach that ...
Hervé Jégou and Romain Tavenard and Matthijs Dou...
HEURISTICS
2010
15 years 1 months ago
A large neighbourhood search approach to the multi-activity shift scheduling problem
The challenge in shift scheduling lies in the construction of a set of work shifts, which are subject to specific regulations, in order to cover fluctuating staff demands. This pro...
Claude-Guy Quimper, Louis-Martin Rousseau