Sciweavers

4670 search results - page 314 / 934
» Testing that distributions are close
Sort
View
IPL
2008
89views more  IPL 2008»
15 years 6 months ago
On the tractability of coloring semirandom graphs
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
Julia Böttcher, Dan Vilenchik
CORR
2007
Springer
97views Education» more  CORR 2007»
15 years 6 months ago
Estimation of the Rate-Distortion Function
—Motivated by questions in lossy data compression and by theoretical considerations, the problem of estimating the rate-distortion function of an unknown (not necessarily discret...
Matthew T. Harrison, Ioannis Kontoyiannis
CORR
2010
Springer
151views Education» more  CORR 2010»
15 years 5 months ago
Adding a referee to an interconnection network: What can(not) be computed in one round
Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...
Florent Becker, Martín Matamala, Nicolas Ni...
CDC
2010
IEEE
106views Control Systems» more  CDC 2010»
15 years 1 months ago
Observational learning in an uncertain world
We study a model of observational learning in social networks in the presence of uncertainty about agents' type distributions. Each individual receives a private noisy signal ...
Daron Acemoglu, Munther A. Dahleh, Asuman E. Ozdag...
CVPR
2010
IEEE
16 years 3 months ago
What is an object?
We present a generic objectness measure, quantifying how likely it is for an image window to contain an object of any class. We explicitly train it to distinguish objects with a...
Pierre America, Robin Milner, Oscar Nierstrasz, Ma...