Sciweavers

889 search results - page 129 / 178
» Observational Learning in Random Networks
Sort
View
STOC
2001
ACM
104views Algorithms» more  STOC 2001»
14 years 9 months ago
Spatial gossip and resource location protocols
The dynamic behavior of a network in which information is changing continuously over time requires robust and efficient mechanisms for keeping nodes updated about new information. ...
David Kempe, Jon M. Kleinberg, Alan J. Demers
STOC
2007
ACM
127views Algorithms» more  STOC 2007»
14 years 9 months ago
First to market is not everything: an analysis of preferential attachment with fitness
The design of algorithms on complex networks, such as routing, ranking or recommendation algorithms, requires a detailed understanding of the growth characteristics of the network...
Christian Borgs, Jennifer T. Chayes, Constantinos ...
BMCBI
2010
152views more  BMCBI 2010»
13 years 9 months ago
Apples and oranges: avoiding different priors in Bayesian DNA sequence analysis
Background: One of the challenges of bioinformatics remains the recognition of short signal sequences in genomic DNA such as donor or acceptor splice sites, splicing enhancers or ...
Jens Keilwagen, Jan Grau, Stefan Posch, Ivo Grosse
ICASSP
2008
IEEE
14 years 3 months ago
Bayesian update of dialogue state for robust dialogue systems
This paper presents a new framework for accumulating beliefs in spoken dialogue systems. The technique is based on updating a Bayesian Network that represents the underlying state...
Blaise Thomson, Jost Schatzmann, Steve Young
NIPS
2000
13 years 10 months ago
Rate-coded Restricted Boltzmann Machines for Face Recognition
We describe a neurally-inspired, unsupervised learning algorithm that builds a non-linear generative model for pairs of face images from the same individual. Individuals are then ...
Yee Whye Teh, Geoffrey E. Hinton