990 search results - page 153 / 198 » Sub-Graphs of Complete Graph |
ICANN
2009
Springer
14 years 6 days ago
2009
Springer
We present a neural system that recognizes faces under strong variations in pose and illumination. The generalization is learnt completely on the basis of examples of a subset of p...
CPM
2001
Springer
14 years 3 days ago
2001
Springer
In 1995, Hannenhalli and Pevzner gave a first polynomial solution to the problem of finding the minimum number of reversals needed to sort a signed permutation.Their solution, a...
SEKE
2001
Springer
14 years 1 days ago
2001
Springer
Source code analysis and inspection does not provide enough information to describe the structure of an objectoriented program completely because there are components and relation...
BIRTHDAY
2000
Springer
13 years 12 months ago
2000
Springer
The axiom system ACP of [10] was extended to discrete time in [6]. Here, we proceed to define the silent step in this theory in branching bisimulation semantics [7, 15] rather th...
COCOON
2000
Springer
13 years 12 months ago
2000
Springer
We consider the parameterized complexity of the following problem under the framework introduced by Downey and Fellows[4]: Given a graph G, an integer parameter k and a non-trivial...