4378 search results - page 172 / 876 » On the Complexity of Ordered Colourings |
171
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...
162
click to vote
AAAI
1990
15 years 7 months ago
1990
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
183
click to vote
EUROCRYPT
2003
Springer
15 years 11 months ago
2003
Springer
A variant of Schnorr’s signature scheme called RDSA has been proposed by I. Biehl, J. Buchmann, S. Hamdy and A. Meyer in order to be used in finite abelian groups of unknown ord...
168
click to vote
WABI
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Comparing gene orders in completely sequenced genomes is a standard approach to locate clusters of functionally associated genes. Often, gene orders are modeled as permut...
151
click to vote
CHI
2002
ACM
16 years 6 months ago
2002
ACM
We have developed a 3D sound system for headphones that allows real-time sound source and user displacement in a virtual acoustic environment. Because of a flexible design that us...