Sciweavers

1168 search results - page 122 / 234
» Optimization strategies for complex queries
Sort
View
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 3 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
DIAL
2004
IEEE
170views Image Analysis» more  DIAL 2004»
15 years 1 months ago
A General System for the Retrieval of Document Images from Digital Libraries
Large collections of scanned documents (books and journals) are now available in Digital Libraries. The most common method for retrieving relevant information from these collectio...
Simone Marinai, Emanuele Marino, Francesca Cesarin...
DEBU
2000
147views more  DEBU 2000»
14 years 9 months ago
XJoin: A Reactively-Scheduled Pipelined Join Operator
Wide-area distribution raises significant performance problems for traditional query processing techniques as data access becomes less predictable due to link congestion, load imb...
Tolga Urhan, Michael J. Franklin
ESA
2011
Springer
231views Algorithms» more  ESA 2011»
13 years 9 months ago
Distribution-Aware Compressed Full-Text Indexes
Abstract. In this paper we address the problem of building a compressed self-index that, given a distribution for the pattern queries and a bound on the space occupancy, minimizes ...
Paolo Ferragina, Jouni Sirén, Rossano Ventu...
CEC
2007
IEEE
15 years 4 months ago
Clonal particle swarm optimization and its applications
— Particle swarm optimization (PSO) is a stochastic global optimization algorithm inspired by social behavior of bird flocking in search for food, which is a simple but powerful...
Y. Tan, Z. M. Xiao