Sciweavers

371 search results - page 59 / 75
» On Two-Dimensional Indexability and Optimal Range Search Ind...
Sort
View
APWEB
2010
Springer
15 years 2 months ago
Optimizing Query Processing for the Hidden Web
Abstract. The term Deep Web (sometimes also called Hidden Web) refers to the data content that is created dynamically as the result of a specific search on the Web. In this respec...
Andrea Calì, Davide Martinenghi
VLDB
2001
ACM
115views Database» more  VLDB 2001»
15 years 2 months ago
Dynamic Update Cube for Range-sum Queries
A range-sum query is very popular and becomes important in finding trends and in discovering relationships between attributes in diverse database applications. It sums over the se...
Seok-Ju Chun, Chin-Wan Chung, Ju-Hong Lee, Seok-Ly...
TIT
2008
102views more  TIT 2008»
14 years 9 months ago
On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes
Abstract--This letter considers the average complexity of maximum-likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path take...
Jie Luo
SIGIR
2009
ACM
15 years 4 months ago
Web derived pronunciations for spoken term detection
Indexing and retrieval of speech content in various forms such as broadcast news, customer care data and on-line media has gained a lot of interest for a wide range of application...
Dogan Can, Erica Cooper, Arnab Ghoshal, Martin Jan...
SIGMOD
2003
ACM
136views Database» more  SIGMOD 2003»
15 years 9 months ago
A Characterization of the Sensitivity of Query Optimization to Storage Access Cost Parameters
Most relational query optimizers make use of information about the costs of accessing tuples and data structures on various storage devices. This information can at times be off b...
Frederick Reiss, Tapas Kanungo