8810 search results - page 445 / 1762 » Openness |
155
click to vote
GD
2004
Springer
16 years 5 days ago
2004
Springer
Abstract. This paper surveys the theory of bidimensional graph problems. We summarize the known combinatorial and algorithmic results of this theory, the foundational Graph Minor r...
152
click to vote
JCDCG
2004
Springer
16 years 4 days ago
2004
Springer
Abstract. Musical rhythm is considered from the point of view of geometry. The interaction between the two fields yields new insights into rhythm and music theory, as well as new ...
173
Voted
MFCS
2004
Springer
16 years 4 days ago
2004
Springer
It was proved by [Garey and Johnson, 1983] that computing the crossing number of a graph is an NP-hard problem. Their reduction, however, used parallel edges and vertices of very h...
178
click to vote
FOCS
2003
IEEE
16 years 2 days ago
2003
IEEE
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...
158
click to vote
JCDL
2003
ACM
16 years 1 days ago
2003
ACM
Expandability is one of the main requirements of future digital libraries. This paper introduces a digital library service system, OpenDLib, that has been designed to be highly ex...