12015 search results - page 2018 / 2403 » Interactive Algorithms 2005 |
182
click to vote
ISAAC
2005
Springer
16 years 8 days ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
176
click to vote
ISCIS
2005
Springer
16 years 8 days ago
2005
Springer
A P2P network that is overlayed over Internet can consist of thousands, or even millions of nodes. To analyze the performance of a P2P network, or an algorithm or protocol designed...
213
click to vote
ISCIS
2005
Springer
16 years 8 days ago
2005
Springer
Support Vector Machines (SVMs) have been applied to solve the classification of volatile organic compounds (VOC) data in some recent studies. SVMs provide good generalization perfo...
193
click to vote
ISMDA
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. One of the first motivations of using grids comes from applications managing large data sets like for example in High Energy Physic or Life Sciences. To improve the glob...
164
Voted
ISMIR
2005
Springer
16 years 8 days ago
2005
Springer
We introduce a new model for extracting classified structural segments, such as intro, verse, chorus, break and so forth, from recorded music. Our approach is to classify signal ...