3958 search results - page 357 / 792 » Dynamic Graph Algorithms with Applications |
209
click to vote
SDM
2009
SIAM
16 years 4 months ago
2009
SIAM
The increasing availability of network data is creating a great potential for knowledge discovery from graph data. In many applications, feature vectors are given in addition to g...
204
click to vote
SPAA
2004
ACM
16 years 5 days ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
187
click to vote
PPOPP
2010
ACM
16 years 1 months ago
2010
ACM
In processors with several levels of hardware resource sharing, like CMPs in which each core is an SMT, the scheduling process becomes more complex than in processors with a singl...
192
click to vote
JHSN
2000
15 years 6 months ago
2000
In order to achieve the best application-level Quality-of-Service (QoS), multimedia applications need to be dynamically tuned and reconfigured to adapt to fluctuating computing an...
188
click to vote
NIPS
2001
15 years 8 months ago
2001
We introduce the Concave-Convex procedure (CCCP) which constructs discrete time iterative dynamical systems which are guaranteed to monotonically decrease global optimization/ener...