5105 search results - page 93 / 1021 » An algorithm to determine peer-reviewers |
116
click to vote
JODS
2007
15 years 13 days ago
2007
We view match as an operator that takes two graph-like structures (e.g., classifications, XML schemas) and produces a mapping between the nodes of these graphs that correspond sema...
136
click to vote
ALGORITHMICA
2002
15 years 12 days ago
2002
A proper coloring of the edges of a graph G is called acyclic if there is no 2-colored cycle in G. The acyclic edge chromatic number of G, denoted by a (G), is the least number of...
113
Voted
JMIV
2000
15 years 10 days ago
2000
Abstract. This paper presents a study, based on conic correspondences, on the relationship between two perspective images acquired by an uncalibrated camera. We show that for a pai...
AI
1998
Springer
15 years 7 days ago
1998
Springer
This paper introduces a niching technique called GAS (S stands for species) which dynamically creates a subpopulation structure (taxonomic chart) using a radius function instead of...
93
Voted
MOC
2002
15 years 6 days ago
2002
In previous work, the author has extended the concept of regular and irregular primes to the setting of arbitrary totally real number fields k0, using the values of the zeta functi...