Sciweavers

40 search results - page 8 / 8
» On Graphs and Codes Preserved by Edge Local Complementation
Sort
View
ICCV
2007
IEEE
13 years 11 months ago
Contextual Distance for Data Perception
Structural perception of data plays a fundamental role in pattern analysis and machine learning. In this paper, we develop a new structural perception of data based on local conte...
Deli Zhao, Zhouchen Lin, Xiaoou Tang
ECEASST
2010
13 years 2 months ago
Safe Integration of Annotated Components in Open Source Projects
: The decision of using existing software components versus building from scratch custom software is one of the most complex and important choices of the entire development/integra...
Sergio Areias, Daniela Carneiro da Cruz, Pedro Ran...
FOCS
2008
IEEE
13 years 11 months ago
Degree Bounded Network Design with Metric Costs
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Ko...
CVPR
2007
IEEE
14 years 6 months ago
Optimizing Binary MRFs via Extended Roof Duality
Many computer vision applications rely on the efficient optimization of challenging, so-called non-submodular, binary pairwise MRFs. A promising graph cut based approach for optim...
Carsten Rother, Vladimir Kolmogorov, Victor S. Lem...
STOC
2007
ACM
140views Algorithms» more  STOC 2007»
14 years 5 months ago
On the submodularity of influence in social networks
We prove and extend a conjecture of Kempe, Kleinberg, and Tardos (KKT) on the spread of influence in social networks. A social network can be represented by a directed graph where...
Elchanan Mossel, Sébastien Roch