Sciweavers

3208 search results - page 224 / 642
» A Lower Bound for Primality
Sort
View
CSR
2011
Springer
14 years 10 months ago
The Complexity of Inversion of Explicit Goldreich's Function by DPLL Algorithms
The Goldreich’s function has n binary inputs and n binary outputs. Every output depends on d inputs and is computed from them by the fixed predicate of arity d. Every Goldreich...
Dmitry Itsykson, Dmitry Sokolov
DAWAK
2011
Springer
14 years 6 months ago
An Envelope-Based Approach to Rotation-Invariant Boundary Image Matching
(The original conference version of this paper mischaracterizes the contributions of the current authors, relative to the contributions of Keogh et al. [11, 12]. We would like to ...
Sang-Pil Kim, Yang-Sae Moon, Sun-Kyong Hong
ALT
2006
Springer
16 years 3 months ago
How Many Query Superpositions Are Needed to Learn?
Abstract. This paper introduces a framework for quantum exact learning via queries, the so-called quantum protocol. It is shown that usual protocols in the classical learning setti...
Jorge Castro
GLOBECOM
2008
IEEE
16 years 1 months ago
Routing with Probabilistic Delay Guarantees in Wireless Ad-Hoc Networks
—In many wireless ad-hoc networks it is important to find a route that delivers a message to the destination within a certain deadline (delay constraint). We propose to identify...
Matthew Brand, Petar Maymounkov, Andreas F. Molisc...
WDAG
2007
Springer
86views Algorithms» more  WDAG 2007»
16 years 21 days ago
Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks
We consider the problem of minimizing the number of ADMs in optical networks. All previous theoretical studies of this problem dealt with the off-line case, where all the lightpat...
Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks