Sciweavers

2842 search results - page 485 / 569
» Expansion and Search in Networks
Sort
View
NN
2007
Springer
13 years 9 months ago
Perception through visuomotor anticipation in a mobile robot
Several scientists suggested that certain perceptual qualities are based on sensorimotor anticipation: for example, the softness of a sponge is perceived by anticipating the sensa...
Heiko Hoffmann
AI
2011
Springer
13 years 5 months ago
Bounded approximate decentralised coordination via the max-sum algorithm
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
Alex Rogers, Alessandro Farinelli, Ruben Stranders...
JMLR
2010
134views more  JMLR 2010»
13 years 5 months ago
Bayesian Algorithms for Causal Data Mining
We present two Bayesian algorithms CD-B and CD-H for discovering unconfounded cause and effect relationships from observational data without assuming causal sufficiency which prec...
Subramani Mani, Constantin F. Aliferis, Alexander ...
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
12 years 19 days ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
WWW
2008
ACM
14 years 11 months ago
As we may perceive: finding the boundaries of compound documents on the web
This paper considers the problem of identifying on the Web compound documents (cDocs) ? groups of web pages that in aggregate constitute semantically coherent information entities...
Pavel Dmitriev