121 search results - page 20 / 25 » Planar case of the maximum box and related problems |
CVBIA
2005
Springer
14 years 1 months ago
2005
Springer
Standard image based segmentation approaches perform poorly when there is little or no contrast along boundaries of different regions. In such cases, segmentation is largely perfor...
JAIR
2006
13 years 7 months ago
2006
The most basic assumption used in statistical learning theory is that training data and test data are drawn from the same underlying distribution. Unfortunately, in many applicati...
NIPS
2007
13 years 9 months ago
2007
We present a novel boosting algorithm, called SoftBoost, designed for sets of binary labeled examples that are not necessarily separable by convex combinations of base hypotheses....
ICALP
1998
Springer
13 years 11 months ago
1998
Springer
Interval Routing Schemes (IRS for short) have been extensively investigated in the past years with special emphasis on shortest paths. Besides their theoretical interest, IRS have...
SAC
2004
ACM
14 years 27 days ago
2004
ACM
The sequence mining problem consists in finding frequent sequential patterns in a database of time-stamped events. Several application domains require limiting the maximum tempor...