Sciweavers

1651 search results - page 248 / 331
» Measuring the Complexity of Classification Problems
Sort
View
ICCV
2005
IEEE
14 years 1 months ago
KALMANSAC: Robust Filtering by Consensus
We propose an algorithm to perform causal inference of the state of a dynamical model when the measurements are corrupted by outliers. While the optimal (maximumlikelihood) soluti...
Andrea Vedaldi, Hailin Jin, Paolo Favaro, Stefano ...
CASES
2004
ACM
14 years 1 months ago
A low power architecture for embedded perception
Recognizing speech, gestures, and visual features are important interface capabilities for future embedded mobile systems. Unfortunately, the real-time performance requirements of...
Binu K. Mathew, Al Davis, Michael Parker
ISMDA
2004
Springer
14 years 1 months ago
Model Selection and Adaptation for Biochemical Pathways
In bioinformatics, biochemical signal pathways can be modeled by many differential equations. It is still an open problem how to fit the huge amount of parameters of the equations...
Rüdiger W. Brause
ICSM
1998
IEEE
14 years 16 days ago
Detection of Logical Coupling Based on Product Release History
Code-based metrics such as coupling and cohesion are used to measure a system's structural complexity. But dealing with large systems--those consisting of several millions of...
Harald Gall, Karin Hajek, Mehdi Jazayeri
NIPS
2007
13 years 9 months ago
Consistent Minimization of Clustering Objective Functions
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure....
Ulrike von Luxburg, Sébastien Bubeck, Stefa...