3958 search results - page 93 / 792 » Dynamic Graph Algorithms with Applications |
144
click to vote
VIP
2003
15 years 6 months ago
2003
When the amount of information in visualization becomes large enough, users can not perceive all elements at the same time. This problem can be solved by removing parts of the inf...
143
Voted
ISMIR
2005
Springer
15 years 10 months ago
2005
Springer
This paper proposes an algorithm for studying spectral contents of pitched sounds in real-world recordings. We assume that the 2nd -order difference, w.r.t. partial index, of a pi...
151
click to vote
PARELEC
2006
IEEE
15 years 11 months ago
2006
IEEE
High performance computing in heterogeneous environments is a dynamically developing area. A number of highly efficient heterogeneous parallel algorithms have been designed over l...
138
Voted
EAAI
2010
14 years 12 months ago
2010
A model of honey bee social foraging is introduced to create an algorithm that solves a class of optimal resource allocation problems. We prove that if several such algorithms (&q...
168
click to vote
STOC
2010
ACM
15 years 9 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...