Sciweavers

2252 search results - page 74 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
COCO
1993
Springer
133views Algorithms» more  COCO 1993»
13 years 12 months ago
On Span Programs
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
Mauricio Karchmer, Avi Wigderson
COCO
2001
Springer
154views Algorithms» more  COCO 2001»
14 years 7 days ago
Quantum Algorithms for Element Distinctness
We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard...
Harry Buhrman, Christoph Dürr, Mark Heiligman...
FUN
2010
Springer
238views Algorithms» more  FUN 2010»
14 years 16 days ago
Mapping an Unfriendly Subway System
We consider a class of highly dynamic networks modelled on an urban subway system. We examine the problem of creating a map of such a subway in less than ideal conditions, where th...
Paola Flocchini, Matthew Kellett, Peter C. Mason, ...
ICIP
2004
IEEE
14 years 9 months ago
Fast full search block motion estimation for H.264/AVC with multilevel successive elimination algorithm
We modify the multilevel successive elimination algorithm (MSEA) to make it compatible with the motion estimation required for the H.264/AVC video coding standard. The algorithm m...
Janne Heikkilä, Tuukka Toivonen
ICALP
2001
Springer
14 years 6 days ago
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...
Peter Høyer, Jan Neerbek, Yaoyun Shi