2304 search results - page 187 / 461 » On the Vulnerability of Large Graphs |
179
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
This paper presents a new volumetric stereo algorithm to reconstruct the 3D shape of an arbitrary object. Our method is based on finding the minimum cut in an octahedral graph str...
172
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
Interactive image search or relevance feedback is the process which helps a user refining his query and finding difficult target categories. This consists in partially labeling a ...
168
click to vote
WSDM
2010
ACM
16 years 3 months ago
2010
ACM
We study the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks. Our objective is to be able to answer distance que...
201
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
Subgraph patterns are widely used in graph classification, but their effectiveness is often hampered by large number of patterns or lack of discrimination power among individual p...
160
click to vote
ICDM
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper studies how to incorporate side information (such as users’ feedback) in measuring node proximity on large graphs. Our method (ProSIN) is motivated by the well-studie...