Sciweavers

17770 search results - page 3203 / 3554
» A Generalization of Forward-Backward Algorithm
Sort
View
132
Voted
STOC
2010
ACM
168views Algorithms» more  STOC 2010»
16 years 2 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
159
Voted
SWAT
1998
Springer
110views Algorithms» more  SWAT 1998»
15 years 8 months ago
On the Number of Regular Vertices of the Union of Jordan Regions
Let C be a collection of n Jordan regions in the plane in general position, such that each pair of their boundaries intersect in at most s points, where s is a constant. Let U den...
Boris Aronov, Alon Efrat, Dan Halperin, Micha Shar...
CORR
2006
Springer
138views Education» more  CORR 2006»
15 years 4 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite
JCSS
2008
120views more  JCSS 2008»
15 years 4 months ago
Quantum certificate complexity
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
Scott Aaronson
CVPR
2005
IEEE
2143views Computer Vision» more  CVPR 2005»
17 years 1 months ago
Level Set Evolution Without Re-initialization: A New Variational Formulation
"In this paper, we present a new variational formulation for geometric active contours that forces the level set function to be close to a signed distance function, and theref...
Chunming Li, Chenyang Xu, Changfeng Gui, and Marti...
« Prev « First page 3203 / 3554 Last » Next »