Sciweavers

12257 search results - page 2158 / 2452
» Analysis of Algorithms
Sort
View
131
Voted
COMPULOG
1999
Springer
15 years 8 months ago
Decomposable Constraints
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...
Ian P. Gent, Kostas Stergiou, Toby Walsh
163
Voted
ISORC
1999
IEEE
15 years 8 months ago
Prediction of Fault-proneness at Early Phase in Object-Oriented Development
To analyze the complexity of object-oriented software, several metrics have been proposed. Among them, Chidamber and Kemerer's metrics are well-known ones as object-oriented ...
Toshihiro Kamiya, Shinji Kusumoto, Katsuro Inoue
HASE
1998
IEEE
15 years 8 months ago
Verification in Concurrent Programming with Petri Nets Structural Techniques
This paper deals with verification of flow control in concurrent programs. We use Ada language model as reference. After translation of Ada programs into Petri nets (named Ada net...
Kamel Barkaoui, Jean-François Pradat-Peyre
129
Voted
SCALESPACE
1999
Springer
15 years 8 months ago
A Scale-Space Based Approach for Deformable Contour Optimization
Abstract. Multiresolution techniques are often used to shorten the execution times of dynamic programming based deformable contour optimization methods by decreasing the image reso...
Yusuf Sinan Akgul, Chandra Kambhamettu
SCALESPACE
1999
Springer
15 years 8 months ago
Morphing Active Contours
ÐA method for deforming curves in a given image to a desired position in a second image is introduced in this paper. The algorithm is based on deforming the first image toward the...
Marcelo Bertalmío, Guillermo Sapiro, Gregor...
« Prev « First page 2158 / 2452 Last » Next »