Sciweavers

925 search results - page 184 / 185
» Connectivity on Complete Lattices
Sort
View
CVPR
2003
IEEE
14 years 8 months ago
What is the Space of Camera Response Functions?
Many vision applications require precise measurement of scene radiance. The function relating scene radiance to image brightness is called the camera response. We analyze the prop...
Michael D. Grossberg, Shree K. Nayar
PODC
2009
ACM
14 years 7 months ago
Simple and efficient asynchronous byzantine agreement with optimal resilience
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
14 years 6 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
STOC
2010
ACM
168views Algorithms» more  STOC 2010»
14 years 3 months ago
Non-commutative circuits and the sum-of-squares problem
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...
Pavel Hrubes, Avi Wigderson and Amir Yehudayoff
ESA
2009
Springer
107views Algorithms» more  ESA 2009»
14 years 1 months ago
Disproof of the Neighborhood Conjecture with Implications to SAT
We study a special class of binary trees. Our results have implications on Maker/Breaker games and SAT: We disprove a conjecture of Beck on positional games and construct an unsati...
Heidi Gebauer