3864 search results - page 355 / 773 » time 2005 |
157
Voted
ISAAC
2005
Springer
16 years 8 days ago
2005
Springer
Given a set S of n points in RD , and an integer k such that 0 k < n, we show that a geometric graph with vertex set S, at most n − 1 + k edges, maximum degree five, and dila...
160
click to vote
ISAAC
2005
Springer
16 years 8 days ago
2005
Springer
We explore the complexity of computing tilings of orthogonal polygons using colored dominoes. A colored domino is a rotatable 2 × 1 rectangle that is partitioned into two unit squ...
217
click to vote
ISAS
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. This paper provides an overview of Proof-Based System Engineering (PBSE), which aims at improving the current practice of developing computer-based systems. PBSE is of pa...
179
click to vote
ISMIR
2005
Springer
16 years 8 days ago
2005
Springer
Supervised learning can be used to create good systems for note segmentation in audio data. However, this requires a large set of labeled training examples, and handlabeling is qu...
164
click to vote
ISMIR
2005
Springer
16 years 8 days ago
2005
Springer
Audio search algorithms have reached a degree of speed and accuracy that allows them to search efficiently within large databases of audio. For speed, algorithms generally depend...