Sciweavers

1578 search results - page 57 / 316
» Algorithmic randomness of continuous functions
Sort
View
ICIAP
2003
ACM
16 years 2 months ago
A statistical rationalisation of Hartley's normalised eight-point algorithm
The eight-point algorithm of Hartley occupies an important place in computer vision, notably as a means of providing an initial value of the fundamental matrix for use in iterativ...
Wojciech Chojnacki, Michael J. Brooks, Anton van d...
111
Voted
FOCS
1989
IEEE
15 years 6 months ago
Randomized Search Trees
We present a randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior. In particular, in the expected case a search or a...
Cecilia R. Aragon, Raimund Seidel
IPCO
2010
153views Optimization» more  IPCO 2010»
15 years 6 days ago
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...
Christoph Buchheim, Alberto Caprara, Andrea Lodi
104
Voted
STOC
2006
ACM
131views Algorithms» more  STOC 2006»
16 years 2 months ago
On maximizing welfare when utility functions are subadditive
We consider the problem of maximizing welfare when allocating m items to n players with subadditive utility functions. Our main result is a way of rounding any fractional solution...
Uriel Feige
130
Voted
SODA
2008
ACM
86views Algorithms» more  SODA 2008»
15 years 3 months ago
Parallel monotonicity reconstruction
We investigate the problem of monotonicity reconstruction, as defined in [3], in a parallel setting. We have oracle access to a nonnegative real-valued function f defined on domai...
Michael E. Saks, C. Seshadhri