Sciweavers

113 search results - page 6 / 23
» Obnoxious Centers in Graphs
Sort
View
88
Voted
SIGCOMM
2010
ACM
14 years 9 months ago
Generic and automatic address configuration for data center networks
Data center networks encode locality and topology information into their server and switch addresses for performance and routing purposes. For this reason, the traditional address...
Kai Chen, Chuanxiong Guo, Haitao Wu, Jing Yuan, Zh...
70
Voted
INFOCOM
2009
IEEE
15 years 4 months ago
Prize-Collecting Data Fusion for Cost-Performance Tradeoff in Distributed Inference
—A novel formulation for optimal sensor selection and in-network fusion for distributed inference known as the prizecollecting data fusion (PCDF) is proposed in terms of optimal ...
Animashree Anandkumar, Meng Wang, Lang Tong, Anant...
CVPR
2007
IEEE
15 years 11 months ago
Learning and Matching Line Aspects for Articulated Objects
Traditional aspect graphs are topology-based and are impractical for articulated objects. In this work we learn a small number of aspects, or prototypical views, from video data. ...
Xiaofeng Ren
COCOON
2003
Springer
15 years 2 months ago
Graph Coloring and the Immersion Order
The relationship between graph coloring and the immersion order is considered. Vertex connectivity, edge connectivity and related issues are explored. These lead to the conjecture...
Faisal N. Abu-Khzam, Michael A. Langston
ICPR
2008
IEEE
15 years 10 months ago
Local Regularized Least-Square Dimensionality Reduction
In this paper, we propose a new nonlinear dimensionality reduction algorithm by adopting regularized least-square criterion on local areas of the data distribution. We first propo...
Changshui Zhang, Yangqing Jia