16430 search results - page 651 / 3286 » On Computable Tree Functions |
217
click to vote
CSFW
2005
IEEE
16 years 25 days ago
2005
IEEE
A number of key establishment protocols claim the property of forward secrecy, where the compromise of a longterm key does not result in the compromise of previously computed sess...
185
click to vote
ECSQARU
2005
Springer
16 years 22 days ago
2005
Springer
The Transferable Belief Model is a general framework for managing imprecise and uncertain information using belief functions. In this framework, the discounting operation allows to...
167
click to vote
GECCO
2005
Springer
16 years 22 days ago
2005
Springer
Using a dynamic systems model for the Simple Genetic Algorithm due to Vose[1], we analyze the fixed point behavior of the model without crossover applied to functions of unitation...
189
click to vote
ICIP
2003
IEEE
16 years 15 days ago
2003
IEEE
Regularization constraints are necessary in inverse problems such as image restoration, optical flow computation or shape from shading to avoid the singularities in the solution....
166
click to vote
MM
2003
ACM
16 years 14 days ago
2003
ACM
In this paper, we propose a novel solution for segmenting an instructional video into hierarchical topical sections. Incorporating the knowledge of education-oriented film theory...