Sciweavers

1756 search results - page 117 / 352
» Mining Query Logs
Sort
View
ESOP
2009
Springer
15 years 4 months ago
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
Hao Yuan, Patrick Th. Eugster
109
Voted
PVLDB
2008
134views more  PVLDB 2008»
15 years 5 days ago
Evita raced: metacompilation for declarative networks
Declarative languages have recently been proposed for many new applications outside of traditional data management. Since these are relatively early research efforts, it is import...
Tyson Condie, David Chu, Joseph M. Hellerstein, Pe...
136
Voted
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
15 years 6 months ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet
95
Voted
DSS
2007
96views more  DSS 2007»
15 years 20 days ago
Factors relating to the decision to click on a sponsored link
In this paper, we report results of an investigation into the factors influencing the selection of sponsored links by e-commerce Web searchers. In this research, 56 participants e...
Bernard J. Jansen, Anna Brown, Marc Resnick
ICDM
2010
IEEE
130views Data Mining» more  ICDM 2010»
14 years 10 months ago
Using Taxonomies to Perform Aggregated Querying over Imprecise Data
-- In this paper, we put forward our approach for answering aggregated queries over imprecise data using domain specific taxonomies. A new concept we call the weighted hierarchical...
Atanu Roy, Chandrima Sarkar, Rafal A. Angryk