2304 search results - page 80 / 461 » On the Vulnerability of Large Graphs |
108
click to vote
CVPR
2005
IEEE
16 years 1 months ago
2005
IEEE
We present a multiscale spectral image segmentation algorithm. In contrast to most multiscale image processing, this algorithm works on multiple scales of the image in parallel, w...
JGT
2007
14 years 11 months ago
2007
It is known that for every integer k ≥ 4, each k-map graph with n vertices has at most kn − 2k edges. Previously, it was open whether this bound is tight or not. We show that ...
116
click to vote
ECCV
2002
Springer
16 years 1 months ago
2002
Springer
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs...
103
click to vote
PVLDB
2008
14 years 11 months ago
2008
Private data often comes in the form of associations between entities, such as customers and products bought from a pharmacy, which are naturally represented in the form of a larg...
109
click to vote
MLG
2007
Springer
15 years 6 months ago
2007
Springer
—Defining the support (or frequency) of a subgraph is trivial when a database of graphs is given: it is simply the number of graphs in the database that contain the subgraph. Ho...