Sciweavers

1236 search results - page 140 / 248
» Prefix-Like Complexities and Computability in the Limit
Sort
View
RTCSA
2009
IEEE
15 years 4 months ago
Bounding the Maximum Length of Non-preemptive Regions under Fixed Priority Scheduling
The question whether preemptive systems are better than non-preemptive systems has been debated for a long time, but only partial answers have been provided in the real-time liter...
Gang Yao, Giorgio C. Buttazzo, Marko Bertogna
EUROGP
2009
Springer
132views Optimization» more  EUROGP 2009»
15 years 4 months ago
A Statistical Learning Perspective of Genetic Programming
Code bloat, the excessive increase of code size, is an important issue in Genetic Programming (GP). This paper proposes a theoretical analysis of code bloat in GP from the perspec...
Nur Merve Amil, Nicolas Bredeche, Christian Gagn&e...
FMCAD
2009
Springer
15 years 4 months ago
Retiming and resynthesis with sweep are complete for sequential transformation
— There is a long history of investigations and debates on whether a sequence of retiming and resynthesis is complete for all sequential transformations (on steady states). It ha...
Hai Zhou
ICB
2009
Springer
355views Biometrics» more  ICB 2009»
15 years 4 months ago
3D Signatures for Fast 3D Face Recognition
We propose a vector representation (called a 3D signature) for 3D face shape in biometrics applications. Elements of the vector correspond to fixed surface points in a face-centere...
Chris Boehnen, Tanya Peters, Patrick J. Flynn
PKDD
2009
Springer
153views Data Mining» more  PKDD 2009»
15 years 4 months ago
Subspace Regularization: A New Semi-supervised Learning Method
Most existing semi-supervised learning methods are based on the smoothness assumption that data points in the same high density region should have the same label. This assumption, ...
Yan-Ming Zhang, Xinwen Hou, Shiming Xiang, Cheng-L...