2304 search results - page 172 / 461 » On the Vulnerability of Large Graphs |
178
click to vote
GBRPR
2007
Springer
16 years 21 days ago
2007
Springer
We introduce a method for computing homology groups and their generators of a 2D image, using a hierarchical structure i.e. irregular graph pyramid. Starting from an image, a hiera...
183
click to vote
CSMR
2006
IEEE
16 years 18 days ago
2006
IEEE
A trace is a record of the execution of a computer program, showing the sequence of operations executed. A trace may be obtained through static or dynamic analysis. An object trac...
155
click to vote
ICRA
2006
IEEE
16 years 17 days ago
2006
IEEE
— Mobile robot localization and navigation requires a map - the robot’s internal representation of the environment. A common problem is that path planning becomes very ineffic...
146
click to vote
PCM
2004
Springer
15 years 12 months ago
2004
Springer
The performance of a Content-Based Image Retrieval (CBIR) system presented in the form of Precision-Recall or PrecisionScope graphs offers an incomplete overview of the system und...
161
click to vote
PAKDD
2010
ACM
15 years 11 months ago
2010
ACM
Given a large, weighted graph, how can we find anomalies? Which rules should be violated, before we label a node as an anomaly? We propose the OddBall algorithm, to find such nod...