1367 search results - page 233 / 274 » Describing Business Processes with Use Cases |
160
click to vote
3DIM
1999
IEEE
15 years 9 months ago
1999
IEEE
In this paper, we report on recent extensions to a surface matching algorithm based on local 3-D signatures. This algorithm was previously shown to be effective in view registrati...
161
click to vote
ICIP
1998
IEEE
16 years 6 months ago
1998
IEEE
We describe a new invariant-based data model for image databases under our approach for shape-based retrieval. The data model relies on contours description of the image shape, an...
166
click to vote
CALCO
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We use coalgebraic methods to describe finitely generated free Heyting algebras. Heyting algebras are axiomatized by rank 0-1 axioms. In the process of constructing free...
134
click to vote
CCGRID
2005
IEEE
15 years 10 months ago
2005
IEEE
We describe a case study that uses grid computing techniques to support the collaborative learning of high school students investigating cosmic rays. Students gather and upload sc...
144
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
The paper presents an extension of Vose’s Markov chain model for genetic algorithm (GA). The model contains not only standard genetic operators such as mutation and crossover bu...