Sciweavers

29 search results - page 5 / 6
» Oblivious Conjunctive Keyword Search
Sort
View
SIGIR
2011
ACM
12 years 10 months ago
Faster top-k document retrieval using block-max indexes
Large search engines process thousands of queries per second over billions of documents, making query processing a major performance bottleneck. An important class of optimization...
Shuai Ding, Torsten Suel
ATS
2009
IEEE
142views Hardware» more  ATS 2009»
14 years 2 months ago
Speeding up SAT-Based ATPG Using Dynamic Clause Activation
Abstract—SAT-based ATPG turned out to be a robust alternative to classical structural ATPG algorithms such as FAN. The number of unclassified faults can be significantly reduce...
Stephan Eggersglüß, Daniel Tille, Rolf ...
SAC
2005
ACM
14 years 1 months ago
An information retrieval model using the fuzzy proximity degree of term occurences
Based on the idea that the closer the query terms in a document are, the more relevant this document is, we propose a mathematical model of information retrieval based on a fuzzy ...
Michel Beigbeder, Annabelle Mercier
CHI
1999
ACM
13 years 12 months ago
The Reader's Helper: A Personalized Document Reading Environment
Over the last two centuries, reading styles have shifted away from the reading of documents from beginning to end and toward the skimming of documents in search of relevant inform...
Jamey Graham
GECCO
2009
Springer
146views Optimization» more  GECCO 2009»
14 years 2 months ago
Using a distance metric to guide PSO algorithms for many-objective optimization
In this paper we propose to use a distance metric based on user-preferences to efficiently find solutions for manyobjective problems. We use a particle swarm optimization (PSO) a...
Upali K. Wickramasinghe, Xiaodong Li