10051 search results - page 197 / 2011 » A Dynamic Separator Algorithm |
179
click to vote
ICWE
2004
Springer
16 years 6 hour ago
2004
Springer
The recent trend in the Internet traffic is increasing in requests for dynamic and personalized content. To efficiently serve this trend, several serverside and cache-side fragme...
185
click to vote
ICDM
2009
IEEE
15 years 4 months ago
2009
IEEE
Clustering methods usually require to know the best number of clusters, or another parameter, e.g. a threshold, which is not ever easy to provide. This paper proposes a new graph-b...
193
click to vote
MP
2010
15 years 1 months ago
2010
In many practical applications, the task is to optimize a non-linear objective function over the vertices of a well-studied polytope as, e.g., the matching polytope or the travelli...
170
click to vote
ICPR
2010
IEEE
16 years 8 days ago
2010
IEEE
Given a sequence of observable features of a linear dynamical system (LDS), we propose the problem of finding a representation of the LDS which is sparse in terms of a given dict...
166
click to vote
ISPD
2000
ACM
15 years 11 months ago
2000
ACM
In this paper, we present an algorithm for delay minimization of interconnect trees by simultaneous buffer insertion/sizing and wire sizing. The algorithm integrates the quadratic...