2304 search results - page 169 / 461 » On the Vulnerability of Large Graphs |
171
click to vote
ICCV
1998
IEEE
16 years 8 months ago
1998
IEEE
W e introduce a novel view-based object representation, called the saliency map graph (SMG), which captures the salient regions of an object view at multiple scales using a wavele...
168
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
158
click to vote
EDBT
2009
ACM
16 years 1 months ago
2009
ACM
The largeness and the heterogeneity of most graph-modeled datasets in several database application areas make the query process a real challenge because of the lack of a complete ...
155
click to vote
FOCS
2008
IEEE
16 years 29 days ago
2008
IEEE
We consider the problem of online sublinear expander reconstruction and its relation to random walks in “noisy” expanders. Given access to an adjacency list representation of ...
160
click to vote
HPDC
2007
IEEE
16 years 26 days ago
2007
IEEE
This paper describes a novel approach to generate an optimized schedule to run threads on distributed shared memory (DSM) systems. The approach relies upon a binary instrumentatio...