Sciweavers

1382 search results - page 117 / 277
» Formal Analysis of Online Algorithms
Sort
View
TACAS
2005
Springer
120views Algorithms» more  TACAS 2005»
15 years 11 months ago
Symbolic Test Selection Based on Approximate Analysis
This paper addresses the problem of generating symbolic test cases for testing the conformance of a black-box implementation with respect to a specification, in the context of rea...
Bertrand Jeannet, Thierry Jéron, Vlad Rusu,...
CVIU
2011
14 years 9 months ago
Polynomial algorithms for subisomorphism of nD open combinatorial maps
Combinatorial maps describe the subdivision of objects in cells, and incidence and adjacency relations between cells, and they are widely used to model 2D and 3D images. However, ...
Guillaume Damiand, Christine Solnon, Colin de la H...
ICML
2009
IEEE
16 years 29 days ago
Rule learning with monotonicity constraints
In classification with monotonicity constraints, it is assumed that the class label should increase with increasing values on the attributes. In this paper we aim at formalizing ...
Wojciech Kotlowski, Roman Slowinski
138
Voted
ECCV
2004
Springer
15 years 11 months ago
A Fourier Theory for Cast Shadows
—Cast shadows can be significant in many computer vision applications, such as lighting-insensitive recognition and surface reconstruction. Nevertheless, most algorithms neglect ...
Ravi Ramamoorthi, Melissa L. Koudelka, Peter N. Be...
TEDU
2008
126views Education» more  TEDU 2008»
15 years 6 months ago
Designing an Educational Game: Case Study of 'Europe 2045'
This paper presents a theoretical framework, which has been adopted in designing an on-line multi-player strategy game Europe 2045. Europe 2045 is an educational tool for high scho...
Vít Sisler, Cyril Brom