2304 search results - page 281 / 461 » On the Vulnerability of Large Graphs |
182
click to vote
ICDM
2006
IEEE
16 years 19 days ago
2006
IEEE
Kernel methods have been shown to be very effective for applications requiring the modeling of structured objects. However kernels for structures usually are too computational dem...
168
click to vote
LATIN
2004
Springer
15 years 12 months ago
2004
Springer
Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large ...
173
click to vote
ICCD
2000
IEEE
15 years 11 months ago
2000
IEEE
This paper presents a verification technique for functional comparison of large combinational circuits using a novel combination of known approaches. The idea is based on a tight...
163
click to vote
GPCE
2007
Springer
15 years 10 months ago
2007
Springer
Large scale software is composed of libraries produced by different entities. Non-intrusive and efficient mechanisms for adapting data structures from one library to conform to AP...
190
click to vote
ACTA
2007
15 years 6 months ago
2007
Abstract We propose an exact algorithm for counting the models of propositional formulas in conjunctive normal form (CNF). Our algorithm is based on the detection of strong backdoo...