840 search results - page 68 / 168 » The Complexity of the Extended GCD Problem |
IWANN
2005
Springer
14 years 1 months ago
2005
Springer
A large class of problems requires real-time processing of complex temporal inputs in real-time. These are difficult tasks for state-of-the-art techniques, since they require captu...
SARA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The presence of long gaps dramatically increases the difficulty of detecting and characterizing complex events hidden in long sequences. In order to cope with this proble...
COLT
2008
Springer
13 years 9 months ago
2008
Springer
This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most t...
ALGORITHMICA
2010
13 years 8 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
GRID
2006
Springer
13 years 7 months ago
2006
Springer
Distributed Grid applications are becoming more and more popular as the use of complex grid middlewares becomes extensive, and more facilities are offered by these complex pieces o...