Sciweavers

683 search results - page 119 / 137
» A Fine-grained Analysis of a Simple Independent Set Algorith...
Sort
View
198
Voted
STOC
1997
ACM
257views Algorithms» more  STOC 1997»
15 years 7 months ago
Practical Loss-Resilient Codes
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decod...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
125
Voted
CAV
1999
Springer
119views Hardware» more  CAV 1999»
15 years 7 months ago
A Theory of Restrictions for Logics and Automata
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
Nils Klarlund
144
Voted
WWW
2006
ACM
16 years 4 months ago
Mining search engine query logs for query recommendation
This paper presents a simple and intuitive method for mining search engine query logs to get fast query recommendations on a large scale industrial-strength search engine. In orde...
Zhiyong Zhang, Olfa Nasraoui
214
Voted
VLDB
2003
ACM
115views Database» more  VLDB 2003»
16 years 3 months ago
Lineage tracing for general data warehouse transformations
Data warehousing systems integrate information from operational data sources into a central repository to enable analysis and mining of the integrated information. During the integ...
Yingwei Cui, Jennifer Widom
125
Voted
PODS
2005
ACM
124views Database» more  PODS 2005»
16 years 3 months ago
Diagnosis of asynchronous discrete event systems: datalog to the rescue!
We consider query optimization techniques for data intensive P2P applications. We show how to adapt an old technique from deductive databases, namely Query-Sub-Query (QSQ), to a s...
Serge Abiteboul, Stefan Haar, Tova Milo, Zoë ...