5169 search results - page 52 / 1034 » Locality approximation using time |
113
click to vote
SODA
2004
ACM
15 years 3 months ago
2004
ACM
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...
117
click to vote
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
113
click to vote
TC
2008
15 years 2 months ago
2008
The common belief is that localized broadcast algorithms are not able to guarantee both full delivery and a good bound on the number of transmissions. In this paper, we propose the...
141
click to vote
PAKDD
2009
ACM
15 years 11 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
121
click to vote
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
In this paper, to automatically generate musical thumbnails that contain the main part of the original tune, we propose a new estimation method for identifying structure changes i...