1951 search results - page 257 / 391 » An algorithm for improving graph partitions |
127
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
150
click to vote
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
We present a novel structure learning method, Max Margin AND/OR Graph (MM-AOG), for parsing the human body into parts and recovering their poses. Our method represents the human b...
161
Voted
WINE
2005
Springer
15 years 10 months ago
2005
Springer
Consider a network vulnerable to viral infection. The system security software can guarantee safety only to a limited part of the network. Such limitations result from economy cos...
142
click to vote
WWW
2005
ACM
16 years 5 months ago
2005
ACM
Link Analysis has been a popular and widely used Web mining technique, especially in the area of Web search. Various ranking schemes based on link analysis have been proposed, of ...
163
click to vote
CIKM
2010
Springer
15 years 3 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...