275 search results - page 18 / 55 » Component factors with large components in graphs |
117
Voted
EON
2007
15 years 1 months ago
2007
We describe an approach to create a synthetic workload for large scale extensional query answering experiments. The workload comprises multiple interrelated domain ontologies, data...
IJBC
2002
14 years 11 months ago
2002
We give a method for finding symbolic dynamics for a planar diffeomorphism with a homoclinic tangle. The method only requires a finite piece of tangle, which can be computed with ...
CPC
2007
14 years 11 months ago
2007
We study a dynamically evolving random graph which adds vertices and edges using preferential attachment and is “attacked by an adversary”. At time t, we add a new vertex xt a...
101
click to vote
ICSE
2008
IEEE-ACM
15 years 11 months ago
2008
IEEE-ACM
Understanding the structure of large existing (and evolving) software systems is a major challenge for software engineers. In reverse engineering, we aim to compute, for a given s...
CAV
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. The problem of finding a small unsatisfiable core of an unsatisfiable CNF formula is addressed. The proposed algorithm, Trimmer, iterates over each internal node d in the...