Sciweavers

141 search results - page 25 / 29
» Bounding basis reduction properties
Sort
View
PG
2007
IEEE
14 years 18 hour ago
Statistical Hypothesis Testing for Assessing Monte Carlo Estimators: Applications to Image Synthesis
Image synthesis algorithms are commonly compared on the basis of running times and/or perceived quality of the generated images. In the case of Monte Carlo techniques, assessment ...
Kartic Subr, James Arvo
EWSN
2006
Springer
14 years 5 months ago
Sift: A MAC Protocol for Event-Driven Wireless Sensor Networks
Nodes in sensor networks often encounter spatially-correlated contention, where multiple nodes in the same neighborhood all sense an event they need to transmit information about....
Kyle Jamieson, Hari Balakrishnan, Y. C. Tay
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
13 years 9 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
POPL
2012
ACM
12 years 1 months ago
Playing in the grey area of proofs
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...
Krystof Hoder, Laura Kovács, Andrei Voronko...
CVPR
2007
IEEE
14 years 7 months ago
What makes a good model of natural images?
Many low-level vision algorithms assume a prior probability over images, and there has been great interest in trying to learn this prior from examples. Since images are very non G...
Yair Weiss, William T. Freeman