Sciweavers

686 search results - page 44 / 138
» On the General Applicability of Instruction-Set Randomizatio...
Sort
View
158
Voted
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
16 years 3 months ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra
147
Voted
SIGIR
2003
ACM
15 years 8 months ago
Table extraction using conditional random fields
The ability to find tables and extract information from them is a necessary component of data mining, question answering, and other information retrieval tasks. Documents often c...
David Pinto, Andrew McCallum, Xing Wei, W. Bruce C...
164
Voted
CORR
2010
Springer
177views Education» more  CORR 2010»
15 years 3 months ago
Supervised Random Walks: Predicting and Recommending Links in Social Networks
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interact...
Lars Backstrom, Jure Leskovec
141
Voted
KDD
2009
ACM
305views Data Mining» more  KDD 2009»
16 years 4 months ago
Grocery shopping recommendations based on basket-sensitive random walk
We describe a recommender system in the domain of grocery shopping. While recommender systems have been widely studied, this is mostly in relation to leisure products (e.g. movies...
Ming Li, M. Benjamin Dias, Ian H. Jarman, Wael El-...
129
Voted
JAL
2002
113views more  JAL 2002»
15 years 3 months ago
A multivariate view of random bucket digital search trees
We take a multivariate view of digital search trees by studying the number of nodes of different types that may coexist in a bucket digital search tree as it grows under an arbitr...
Friedrich Hubalek, Hsien-Kuei Hwang, William Lew, ...