Sciweavers

780 search results - page 76 / 156
» Robustness and Randomness
Sort
View
ICML
2004
IEEE
14 years 9 months ago
Approximate inference by Markov chains on union spaces
A standard method for approximating averages in probabilistic models is to construct a Markov chain in the product space of the random variables with the desired equilibrium distr...
Max Welling, Michal Rosen-Zvi, Yee Whye Teh
BERTINORO
2005
Springer
14 years 2 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
AAAI
2008
13 years 11 months ago
Feature Selection for Activity Recognition in Multi-Robot Domains
In multi-robot settings, activity recognition allows a robot to respond intelligently to the other robots in its environment. Conditional random fields are temporal models that ar...
Douglas L. Vail, Manuela M. Veloso
AVI
2006
13 years 10 months ago
Just how dense are dense graphs in the real world?: a methodological note
This methodological note focuses on the edge density of real world examples of networks. The edge density is a parameter of interest typically when putting up user studies in an e...
Guy Melançon
PVLDB
2008
127views more  PVLDB 2008»
13 years 8 months ago
Hashed samples: selectivity estimators for set similarity selection queries
We study selectivity estimation techniques for set similarity queries. A wide variety of similarity measures for sets have been proposed in the past. In this work we concentrate o...
Marios Hadjieleftheriou, Xiaohui Yu, Nick Koudas, ...