Sciweavers

693 search results - page 60 / 139
» Minimization and Partitioning Method Reducing Input Sets
Sort
View
ML
2000
ACM
15 years 1 months ago
Randomizing Outputs to Increase Prediction Accuracy
Bagging and boosting reduce error by changing both the inputs and outputs to form perturbed training sets, grow predictors on these perturbed training sets and combine them. A que...
Leo Breiman
ALGORITHMICA
2007
145views more  ALGORITHMICA 2007»
15 years 1 months ago
Counting Integer Points in Parametric Polytopes Using Barvinok's Rational Functions
Abstract Many compiler optimization techniques depend on the ability to calculate the number of elements that satisfy certain conditions. If these conditions can be represented by ...
Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vi...
143
Voted
TIP
2011
164views more  TIP 2011»
14 years 8 months ago
Multiregion Image Segmentation by Parametric Kernel Graph Cuts
Abstract—The purpose of this study is to investigate multiregion graph cut image partitioning via kernel mapping of the image data. The image data is transformed implicitly by a ...
Mohamed Ben Salah, Amar Mitiche, Ismail Ben Ayed
AUTOMATICA
2010
104views more  AUTOMATICA 2010»
15 years 1 months ago
Identification for robust H2 deconvolution filtering
This paper addresses robust deconvolution filtering when the system and noise dynamics are obtained by parametric system identification. Consistent with standard identification me...
Xavier Bombois, Håkan Hjalmarsson, Gé...
ICDE
2005
IEEE
135views Database» more  ICDE 2005»
16 years 2 months ago
Finding (Recently) Frequent Items in Distributed Data Streams
We consider the problem of maintaining frequency counts for items occurring frequently in the union of multiple distributed data streams. Na?ive methods of combining approximate f...
Amit Manjhi, Vladislav Shkapenyuk, Kedar Dhamdhere...