Sciweavers

284 search results - page 19 / 57
» What Matchings Can Be Stable
Sort
View
IJET
2007
121views more  IJET 2007»
13 years 8 months ago
A Technology Based Program That Matches Enrichment Resources With Student Strengths
Remarkable advances in instructional communication technology (ICT) have now made is possible to provide high levels of enrichment and the kinds of curricular differentiation that...
Joseph S. Renzulli, Sally M. Reis
ASPDAC
1999
ACM
144views Hardware» more  ASPDAC 1999»
14 years 23 days ago
Model Order Reduction of Large Circuits Using Balanced Truncation
A method is introduced for model order reduction of large circuits extracted from layout. The algorithm, which is based on balanced realization, can be used for reducing the order ...
Payam Rabiei, Massoud Pedram
ICPR
2008
IEEE
14 years 2 months ago
Non-rigid image registration based on the globally optimized correspondences
In this paper, we propose a new approach to the non-rigid image registration. This problem can be easily attacked if we can find regularly distributed correspondence points over ...
Hyung il Koo, Jung Gap Kuk, Nam Ik Cho
ICPR
2006
IEEE
14 years 9 months ago
Compound Stochastic Models For Fingerprint Individuality
The question of fingerprint individuality can be posed as follows: Given a query fingerprint, what is the probability that the observed number of minutiae matches with a template ...
Anil K. Jain, Sarat C. Dass, Yongfang Zhu
GECCO
2003
Springer
114views Optimization» more  GECCO 2003»
14 years 1 months ago
Learning the Ideal Evaluation Function
Abstract. Designing an adequate fitness function requiressubstantial knowledge of a problem and of features that indicate progress towards a solution. Coevolution takes the human ...
Edwin D. de Jong, Jordan B. Pollack