1236 search results - page 140 / 248 » Prefix-Like Complexities and Computability in the Limit |
171
click to vote
RTCSA
2009
IEEE
16 years 1 months ago
2009
IEEE
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...
159
click to vote
EUROGP
2009
Springer
16 years 29 days ago
2009
Springer
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...
150
click to vote
FMCAD
2009
Springer
16 years 29 days ago
2009
Springer
— 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...
195
click to vote
ICB
2009
Springer
16 years 28 days ago
2009
Springer
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...
172
click to vote
PKDD
2009
Springer
16 years 28 days ago
2009
Springer
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, ...