3837 search results - page 9 / 768 » Learning Approximate Consistencies |
205
Voted
SDM
2011
SIAM
14 years 9 months ago
2011
SIAM
Multi-instance (MI) learning is a variant of supervised learning where labeled examples consist of bags (i.e. multi-sets) of feature vectors instead of just a single feature vecto...
149
Voted
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
We consider the problem of discovering a smooth unknown surface S bounding an object O in R3 . The discovery process consists of moving a point probing device in the free space ar...
155
Voted
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
160
click to vote
DAM
2010
15 years 6 months ago
2010
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
174
click to vote
GOSLER
1995
15 years 10 months ago
1995
In designing learning algorithms it seems quite reasonable to construct them in such a way that all data the algorithm already has obtained are correctly and completely reflected...