2304 search results - page 304 / 461 » On the Vulnerability of Large Graphs |
ICCV
1999
IEEE
16 years 2 months ago
1999
IEEE
Using a saliency measure based on the global property of contour closure, we have developed a method that reliably segments out salient contours bounding unknown objects from real...
183
Voted
ICDE
2000
IEEE
16 years 2 months ago
2000
IEEE
Dynamic Miss-Countingalgorithms are proposed, which find all implication and similarity rules with confidence pruning but without support pruning. To handle data sets with a large...
98
Voted
DAC
2006
ACM
16 years 2 months ago
2006
ACM
Chips manufactured in 90 nm technology have shown large parametric variations, and a worsening trend is predicted. These parametric variations make circuit optimization difficult ...
125
Voted
ICML
2005
IEEE
16 years 1 months ago
2005
IEEE
Graph-based methods for semi-supervised learning have recently been shown to be promising for combining labeled and unlabeled data in classification problems. However, inference f...
99
Voted
IPPS
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract— The use of many distributed, heterogeneous resources as a large collective platform offers great potential. A key issue for these grid platforms is middleware scalabili...