Sciweavers

19320 search results - page 274 / 3864
» On the complexity of computing determinants
Sort
View
GD
2009
Springer
15 years 10 months ago
Complexity of Some Geometric and Topological Problems
We show that recognizing intersection graphs of convex sets has the same complexity as deciding truth in the existential theory of the reals. Comparing this to similar results on t...
Marcus Schaefer
DAGSTUHL
2006
15 years 8 months ago
Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries
Generalizing earlier work characterizing the quantum query complexity of computing a function of an unknown classical "black box" function drawn from some set of such bl...
Howard Barnum
BMVC
2010
15 years 4 months ago
Multiscale Keypoint Analysis based on Complex Wavelets
We describe a new multiscale keypoint detector and a set of local visual descriptors, both based on the efficient Dual-Tree Complex Wavelet Transform. The detector has properties ...
Pashmina Bendale, Bill Triggs, Nick G. Kingsbury
STACS
2009
Springer
16 years 1 months ago
On the Average Complexity of Moore's State Minimization Algorithm
Abstract. We prove that, for any arbitrary finite alphabet and for the uniform distribution over deterministic and accessible automata with n states, the average complexity of Moo...
Frédérique Bassino, Julien David, Cy...
STOC
2005
ACM
101views Algorithms» more  STOC 2005»
16 years 6 days ago
The round complexity of two-party random selection
We study the round complexity of two-party protocols for generating a random nbit string such that the output is guaranteed to have bounded bias (according to some measure) even i...
Saurabh Sanghvi, Salil P. Vadhan