Sciweavers

441 search results - page 21 / 89
» Query expansion using random walk models
Sort
View
AAAI
2011
12 years 9 months ago
Markov Logic Sets: Towards Lifted Information Retrieval Using PageRank and Label Propagation
Inspired by “GoogleTM Sets” and Bayesian sets, we consider the problem of retrieving complex objects and relations among them, i.e., ground atoms from a logical concept, given...
Marion Neumann, Babak Ahmadi, Kristian Kersting
BERTINORO
2005
Springer
14 years 3 months ago
Design and Analysis of a Bio-inspired Search Algorithm for Peer to Peer Networks
Decentralized peer to peer (p2p) networks like Gnutella are attractive for certain applications because they require no centralized directories and no precise control over network ...
Niloy Ganguly, Lutz Brusch, Andreas Deutsch
ICASSP
2011
IEEE
13 years 1 months ago
On the success of network inference using a markov routing model
In this paper we discuss why a simple network topology inference algorithm based on network co-occurrence measurements and a Markov random walk model for routing enables perfect t...
Laura Balzano, Robert Nowak, Matthew Roughan
ACL
2009
13 years 7 months ago
A NLG-based Application for Walking Directions
This work describes an online application that uses Natural Language Generation (NLG) methods to generate walking directions in combination with dynamic 2D visualisation. We make ...
Michael Roth, Anette Frank
NN
2000
Springer
165views Neural Networks» more  NN 2000»
13 years 9 months ago
Construction of confidence intervals for neural networks based on least squares estimation
We present the theoretical results about the construction of confidence intervals for a nonlinear regression based on least squares estimation and using the linear Taylor expansio...
Isabelle Rivals, Léon Personnaz