Sciweavers

59 search results - page 11 / 12
» A Natural Counting of Lambda Terms
Sort
View
CIKM
2010
Springer
14 years 10 months ago
Who should I cite: learning literature search models from citation behavior
Scientists depend on literature search to find prior work that is relevant to their research ideas. We introduce a retrieval model for literature search that incorporates a wide ...
Steven Bethard, Dan Jurafsky
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
16 years 12 days ago
Dense itemsets
Frequent itemset mining has been the subject of a lot of work in data mining research ever since association rules were introduced. In this paper we address a problem with frequen...
Heikki Mannila, Jouni K. Seppänen
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
16 years 9 days ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
PODS
2005
ACM
211views Database» more  PODS 2005»
16 years 4 days ago
Join-distinct aggregate estimation over update streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. Pro...
Sumit Ganguly, Minos N. Garofalakis, Amit Kumar, R...
FOCS
2009
IEEE
15 years 6 months ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu