1439 search results - page 94 / 288 » Bagging with Adaptive Costs |
PAMI
2010
13 years 6 months ago
2010
—Representing 2D and 3D data sets with implicit polynomials (IPs) has been attractive because of its applicability to various computer vision issues. Therefore, many IP fitting m...
ICIP
2010
IEEE
13 years 5 months ago
2010
IEEE
Direct implementations of bilateral filtering show O(r2 ) computational complexity per pixel, where r is the filter window radius. Several lower complexity methods have been devel...
PAKDD
2011
ACM
13 years 1 months ago
2011
ACM
Discovering rare categories and classifying new instances of them is
an important data mining issue in many fields, but fully supervised
learning of a rare class classifier is pr...
PAKDD
2011
ACM
12 years 10 months ago
2011
ACM
Discovering rare categories and classifying new instances of them is an important data mining issue in many fields, but fully supervised learning of a rare class classifier is pr...
ICSE
2000
IEEE-ACM
13 years 11 months ago
2000
IEEE-ACM
Interactive program analysis tools are often tailored to one particular representation of programs, making adaptation to a new language costly. One way to ease adaptability is to ...