7228 search results - page 412 / 1446 » From Algorithmic to Subjective Randomness |
227
click to vote
DCOSS
2006
Springer
15 years 11 months ago
2006
Springer
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
221
click to vote
CDC
2008
IEEE
16 years 2 months ago
2008
IEEE
— We investigate the effect of packet delays and packet drops on networked control systems. First we consider the problem of where to locate a controller or state estimator in a...
240
click to vote
HT
2010
ACM
15 years 9 months ago
2010
ACM
We investigate the use of autonomically created small-world graphs as a framework for the long term storage of digital objects on the Web in a potentially hostile environment. We ...
213
click to vote
SODA
2012
ACM
13 years 10 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
204
click to vote
CVPR
2007
IEEE
16 years 9 months ago
2007
IEEE
In this paper we propose and evaluate an algorithm that learns a similarity measure for comparing never seen objects. The measure is learned from pairs of training images labeled ...