Sciweavers

2218 search results - page 349 / 444
» Testing Expressibility Is Hard
Sort
View
131
Voted
GECCO
2010
Springer
169views Optimization» more  GECCO 2010»
15 years 5 months ago
Robust symbolic regression with affine arithmetic
We use affine arithmetic to improve both the performance and the robustness of genetic programming for symbolic regression. During evolution, we use affine arithmetic to analyze e...
Cassio Pennachin, Moshe Looks, João A. de V...
140
Voted
ACCV
2010
Springer
15 years 4 months ago
Identifying Surprising Events in Videos Using Bayesian Topic Models
Automatic processing of video data is essential in order to allow efficient access to large amounts of video content, a crucial point in such applications as video mining and surve...
Avishai Hendel, Daphna Weinshall, Shmuel Peleg
132
Voted
FLAIRS
2008
15 years 4 months ago
Conditional and Composite Constraints with Preferences
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
Malek Mouhoub, Amrudee Sukpan
133
Voted
CIBB
2008
15 years 4 months ago
Unsupervised Stability-Based Ensembles to Discover Reliable Structures in Complex Bio-molecular Data
The assessment of the reliability of clusters discovered in bio-molecular data is a central issue in several bioinformatics problems. Several methods based on the concept of stabil...
Alberto Bertoni, Giorgio Valentini
131
Voted
BPM
2006
Springer
128views Business» more  BPM 2006»
15 years 4 months ago
Towards Formal Verification of Web Service Composition
Abstract. Web services composition is an emerging paradigm for enabling application integration within and across organizational boundaries. Current Web services composition propos...
Mohsen Rouached, Olivier Perrin, Claude Godart