Sciweavers

1545 search results - page 187 / 309
» On tree congestion of graphs
Sort
View
ARSCOM
2002
70views more  ARSCOM 2002»
14 years 10 months ago
On the Number of Graphical Forest Partitions
A graphical partition of the even integer n is a partition of n where each part of the partition is the degree of a vertex in a simple graph and the degree sum of the graph is n. ...
Deborah A. Frank, Carla D. Savage, James A. Seller...
RSA
2010
89views more  RSA 2010»
14 years 8 months ago
Edge flows in the complete random-lengths network
Consider the complete n-vertex graph whose edge-lengths are independent exponentially distributed random variables. Simultaneously for each pair of vertices, put a constant flow ...
David J. Aldous, Shankar Bhamidi
SIAMDM
2010
117views more  SIAMDM 2010»
14 years 8 months ago
Design is as Easy as Optimization
We consider the class of max-min and min-max optimization problems subject to a global budget (or weight) constraint and we undertake a systematic algorithmic and complexitytheore...
Deeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vaz...
CVPR
2012
IEEE
13 years 14 days ago
Face detection, pose estimation, and landmark localization in the wild
We present a unified model for face detection, pose estimation, and landmark estimation in real-world, cluttered images. Our model is based on a mixtures of trees with a shared p...
Xiangxin Zhu, Deva Ramanan
SPAA
2010
ACM
15 years 2 months ago
Tree network coding for peer-to-peer networks
Partitioning is the dominant technique to transmit large files in peer-to-peer networks. A peer can redistribute each part immediately after its download. BitTorrent combines thi...
Arne Vater, Christian Schindelhauer, Christian Ort...