Sciweavers

886 search results - page 103 / 178
» On the Autoreducibility of Random Sequences
Sort
View
CORR
2007
Springer
79views Education» more  CORR 2007»
13 years 7 months ago
Connecting Polygonizations via Stretches and Twangs
We show that the space of polygonizations of a fixed planar point set S of n points is connected by O(n2 ) “moves” between simple polygons. Each move is composed of a sequence...
Mirela Damian, Robin Y. Flatland, Joseph O'Rourke,...
ALGORITHMICA
2005
108views more  ALGORITHMICA 2005»
13 years 7 months ago
Key-Independent Optimality
A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, keyindependent optimality, is motivated by applications that assign key v...
John Iacono
CANDC
2009
ACM
14 years 2 months ago
Subliminal wiretapping
Subliminal Wiretapping is a subtly interactive artwork that utilizes random number generation modified through mindmatter effects to supply a continuous stream of words. Frequent,...
Shawn Lawson
SENSYS
2003
ACM
14 years 1 months ago
On the scaling laws of dense wireless sensor networks
We consider dense wireless sensor networks deployed to observe arbitrary random fields. The requirement is to reconstruct an estimate of the random field at a certain collector ...
Praveen Kumar Gopala, Hesham El Gamal
TIT
2008
90views more  TIT 2008»
13 years 7 months ago
Scanning and Sequential Decision Making for Multidimensional Data - Part II: The Noisy Case
We consider the problem of sequential decision making for random fields corrupted by noise. In this scenario, the decision maker observes a noisy version of the data, yet judged wi...
Asaf Cohen, Tsachy Weissman, Neri Merhav