Sciweavers

43 search results - page 6 / 9
» Predicting Interval Probability in Data Querying
Sort
View
EMNLP
2010
13 years 5 months ago
Learning Recurrent Event Queries for Web Search
Recurrent event queries (REQ) constitute a special class of search queries occurring at regular, predictable time intervals. The freshness of documents ranked for such queries is ...
Ruiqiang Zhang, Yuki Konda, Anlei Dong, Pranam Kol...
PODS
2010
ACM
207views Database» more  PODS 2010»
14 years 21 days ago
Understanding cardinality estimation using entropy maximization
Cardinality estimation is the problem of estimating the number of tuples returned by a query; it is a fundamentally important task in data management, used in query optimization, ...
Christopher Ré, Dan Suciu
ESORICS
2009
Springer
14 years 8 months ago
Data Structures with Unpredictable Timing
Abstract. A range of attacks on network components, such as algorithmic denial-of-service attacks and cryptanalysis via timing attacks, are enabled by data structures for which an ...
Darrell Bethea, Michael K. Reiter
AINA
2008
IEEE
14 years 2 months ago
Dynamic Cache Invalidation Scheme in IR-Based Wireless Environments
Traditional cache invalidation schemes are not suitable to be employed in wireless environments due to the affections of mobility, energy consumption, and limited bandwidth. Cache ...
Yeim-Kuan Chang, Yi-Wei Ting, Tai-Hong Lin
PVLDB
2008
118views more  PVLDB 2008»
13 years 7 months ago
Efficient top-k processing over query-dependent functions
We study the efficient evaluation of top-k queries over data items, where the score of each item is dynamically computed by applying an item-specific function whose parameter valu...
Lin Guo, Sihem Amer-Yahia, Raghu Ramakrishnan, Jay...