1930 search results - page 9 / 386 » A Dynamic Graph Algorithm for the Highly Dynamic Network Pro... |
PLDI
2004
ACM
14 years 24 days ago
2004
ACM
Although dynamic program slicing was first introduced to aid in user level debugging, applications aimed at improving software quality, reliability, security, and performance hav...
PAMI
2011
13 years 2 months ago
2011
Optimization is a powerful paradigm for expressing and solving problems in a wide range of areas, and has been successfully applied to many vision problems. Discrete optimization ...
INFOCOM
2012
IEEE
11 years 9 months ago
2012
IEEE
Abstract— We consider a wireless broadcast station that transmits packets to multiple users. The packet requests for each user may overlap, and some users may already have certai...
ISAAC
2004
Springer
14 years 22 days ago
2004
Springer
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
EOR
2008
13 years 7 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...