5592 search results - page 775 / 1119 » On Random Betweenness Constraints |
186
click to vote
GD
2009
Springer
16 years 4 days ago
2009
Springer
Let n ≥ 4 be even. It is shown that every set S of n points in the plane can be connected by a (possibly self-intersecting) spanning tour (Hamiltonian cycle) consisting of n str...
210
click to vote
COCO
2001
Springer
16 years 1 days ago
2001
Springer
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
219
Voted
ICALP
2001
Springer
16 years 7 hour ago
2001
Springer
Abstract. We consider the sequence comparison problem, also known as “hidden pattern” problem, where one searches for a given subsequence in a text (rather than a string unders...
215
click to vote
IWQOS
2001
Springer
15 years 12 months ago
2001
Springer
The IETF’s Integrated Services (IntServ) architecture together with reservation aggregation provide a mechanism to support the quality-of-service demands of real-time flows in a...
203
click to vote
PKC
2001
Springer
15 years 12 months ago
2001
Springer
At ISW’99, Nishioka, Hanaoka and Imai proposed a digital signature scheme on ID-based key-sharing infrastructures. That signature scheme is claimed to be secure if the discrete l...