Sciweavers

3225 search results - page 483 / 645
» Query Optimization by Stored Queries
Sort
View
ICTIR
2009
Springer
15 years 4 months ago
An Analysis of NP-Completeness in Novelty and Diversity Ranking
Abstract. A useful ability for search engines is to be able to rank objects with novelty and diversity: the top k documents retrieved should cover possible interpretations of a que...
Ben Carterette
ESA
2011
Springer
231views Algorithms» more  ESA 2011»
14 years 6 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...
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
16 years 1 months ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith
HPDC
2005
IEEE
16 years 1 days ago
Recording and using provenance in a protein compressibility experiment
Very large scale computations are now becoming routinely used as a methodology to undertake scientific research. In this context, ‘provenance systems’ are regarded as the equ...
Paul T. Groth, Simon Miles, Weijian Fang, Sylvia C...
ICNP
2003
IEEE
15 years 11 months ago
Data Dissemination with Ring-Based Index for Wireless Sensor Networks
In current sensor networks, sensor nodes are capable of not only measuring real world phenomena, but also storing, processing and transferring these measurements. Many data dissem...
Wensheng Zhang, Guohong Cao, Thomas F. La Porta