7228 search results - page 302 / 1446 » From Algorithmic to Subjective Randomness |
149
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
147
click to vote
PODC
2009
ACM
16 years 5 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
128
click to vote
SODA
2012
ACM
13 years 7 months ago
2012
ACM
The Matroid Secretary Problem, introduced by Babaioff et al. (2007), is a generalization of the Classical Secretary Problem. In this problem, elements from a matroid are presente...
120
click to vote
ACL
2006
15 years 6 months ago
2006
In order to build a simulated robot that accepts instructions in unconstrained natural language, a corpus of 427 route instructions was collected from human subjects in the office...
136
click to vote
ICCV
2009
IEEE
16 years 9 months ago
2009
IEEE
We present a novel representation for modeling textured
regions subject to smooth variations in orientation and
scale. Utilizing the steerable pyramid of Simoncelli and
Freeman ...