195 search results - page 24 / 39 » A fast algorithm for power grid design |
ICALP
2003
Springer
14 years 24 days ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
Robustness to illumination variations is a key requirement for the problem of change detection which in turn is a fundamental building block for many visual surveillance applicati...
SDM
2009
SIAM
14 years 4 months ago
2009
SIAM
Graphs appear in several settings, like social networks, recommendation systems, computer communication networks, gene/protein biological networks, among others. A deep, recurring...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
Packet Classification (PC) has been a critical data path function for many emerging networking applications. An interesting approach is the use of TCAM to achieve deterministic, hi...
UIST
2010
ACM
13 years 5 months ago
2010
ACM
We present a system for the actuation of tangible magnetic widgets (Madgets) on interactive tabletops. Our system combines electromagnetic actuation with fiber optic tracking to m...