Sciweavers

775 search results - page 151 / 155
» First-order probabilistic inference
Sort
View
ICALP
2001
Springer
13 years 12 months ago
Approximating the Minimum Spanning Tree Weight in Sublinear Time
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan
ISIPTA
1999
IEEE
116views Mathematics» more  ISIPTA 1999»
13 years 11 months ago
On the Distribution of Natural Probability Functions
The purpose of this note is to describe the underlying insights and results obtained by the authors, and others, in a series of papers aimed at modelling the distribution of `natu...
Jeff B. Paris, Paul N. Watton, George M. Wilmers
SIGMOD
1993
ACM
163views Database» more  SIGMOD 1993»
13 years 11 months ago
The LRU-K Page Replacement Algorithm For Database Disk Buffering
This paper introduces a new approach to database disk buffering, called the LRU–K method. The basic idea of LRU–K is to keep track of the times of the last K references to pop...
Elizabeth J. O'Neil, Patrick E. O'Neil, Gerhard We...
AUSAI
2008
Springer
13 years 9 months ago
Character Recognition Using Hierarchical Vector Quantization and Temporal Pooling
In recent years, there has been a cross-fertilization of ideas between computational neuroscience models of the operation of the neocortex and artificial intelligence models of mac...
John Thornton, Jolon Faichney, Michael Blumenstein...
KDD
2010
ACM
250views Data Mining» more  KDD 2010»
13 years 9 months ago
On community outliers and their efficient detection in information networks
Linked or networked data are ubiquitous in many applications. Examples include web data or hypertext documents connected via hyperlinks, social networks or user profiles connected...
Jing Gao, Feng Liang, Wei Fan, Chi Wang, Yizhou Su...