376 search results - page 21 / 76 » Betweenness Centrality : Algorithms and Lower Bounds |
NIPS
2008
13 years 9 months ago
2008
We describe a primal-dual framework for the design and analysis of online strongly convex optimization algorithms. Our framework yields the tightest known logarithmic regret bound...
ISPD
2004
ACM
14 years 1 months ago
2004
ACM
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—A joint congestion control, channel allocation and scheduling algorithm for multi-channel multi-interface multihop wireless networks is discussed. The goal of maximizing a utili...
RT
1995
Springer
13 years 11 months ago
1995
Springer
: This paper introduces an efficient hierarchical algorithm capable of simulating light transfer for complex scenes containing non-diffuse surfaces. The algorithmstemsfroma newfor...
PODC
2009
ACM
14 years 8 months ago
2009
ACM
d Abstract] Christoph Lenzen Computer Engineering and Networks Laboratory (TIK) ETH Zurich, 8092 Zurich, Switzerland lenzen@tik.ee.ethz.ch Thomas Locher Computer Engineering and N...