Sciweavers

2989 search results - page 277 / 598
» Using Domain-Independent Problems for Introducing Formal Met...
Sort
View
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
15 years 10 months ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein
ICML
2009
IEEE
16 years 1 months ago
Decision tree and instance-based learning for label ranking
The label ranking problem consists of learning a model that maps instances to total orders over a finite set of predefined labels. This paper introduces new methods for label ra...
Weiwei Cheng, Jens C. Huhn, Eyke Hüllermeier
CMSB
2006
Springer
15 years 10 months ago
Possibilistic Approach to Biclustering: An Application to Oligonucleotide Microarray Data Analysis
Abstract. The important research objective of identifying genes with similar behavior with respect to different conditions has recently been tackled with biclustering techniques. I...
Maurizio Filippone, Francesco Masulli, Stefano Rov...
172
Voted
JMLR
2008
117views more  JMLR 2008»
15 years 6 months ago
Active Learning by Spherical Subdivision
We introduce a computationally feasible, "constructive" active learning method for binary classification. The learning algorithm is initially formulated for separable cl...
Falk-Florian Henrich, Klaus Obermayer
ICASSP
2011
IEEE
14 years 10 months ago
Multiple instance tracking based on hierarchical maximizing bag's margin boosting
In online tracking, the tracker evolves to reflect variations in object appearance and surroundings. This updating process is formulated as a supervised learning problem, thus a ...
Chunxiao Liu, Guijin Wang, Xinggang Lin, Bobo Zeng