Sciweavers

1651 search results - page 121 / 331
» Measuring the Complexity of Classification Problems
Sort
View
ESA
2000
Springer
141views Algorithms» more  ESA 2000»
13 years 11 months ago
Preemptive Scheduling with Rejection
We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the job...
Han Hoogeveen, Martin Skutella, Gerhard J. Woeging...
ICPR
2002
IEEE
14 years 9 months ago
Bayesian Networks as Ensemble of Classifiers
Classification of real-world data poses a number of challenging problems. Mismatch between classifier models and true data distributions on one hand and the use of approximate inf...
Ashutosh Garg, Vladimir Pavlovic, Thomas S. Huang
ICCV
2009
IEEE
13 years 5 months ago
Jointly estimating demographics and height with a calibrated camera
One important problem in computer vision is to provide a demographic description a person from an image. In practice, many of the state-of-the-art methods use only an analysis of ...
Andrew C. Gallagher, Andrew C. Blose, Tsuhan Chen
CORR
2007
Springer
104views Education» more  CORR 2007»
13 years 8 months ago
Sorting and Selection in Posets
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...
Constantinos Daskalakis, Richard M. Karp, Elchanan...
ICML
2008
IEEE
14 years 8 months ago
A reproducing kernel Hilbert space framework for pairwise time series distances
A good distance measure for time series needs to properly incorporate the temporal structure, and should be applicable to sequences with unequal lengths. In this paper, we propose...
Zhengdong Lu, Todd K. Leen, Yonghong Huang, Deniz ...