Sciweavers

417 search results - page 47 / 84
» Generalization Bounds for Some Ordinal Regression Algorithms
Sort
View
STOC
2003
ACM
152views Algorithms» more  STOC 2003»
15 years 10 months ago
Reducing truth-telling online mechanisms to online optimization
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
Baruch Awerbuch, Yossi Azar, Adam Meyerson
SODA
1998
ACM
159views Algorithms» more  SODA 1998»
14 years 11 months ago
Average-Case Analyses of First Fit and Random Fit Bin Packing
We prove that the First Fit bin packing algorithm is stable under the input distribution U{k - 2, k} for all k 3, settling an open question from the recent survey by Coffman, Gar...
Susanne Albers, Michael Mitzenmacher
MM
2006
ACM
221views Multimedia» more  MM 2006»
15 years 3 months ago
Video object segmentation by motion-based sequential feature clustering
Segmentation of video foreground objects from background has many important applications, such as human computer interaction, video compression, multimedia content editing and man...
Mei Han, Wei Xu, Yihong Gong
MFCS
2001
Springer
15 years 2 months ago
News from the Online Traveling Repairman
In the traveling repairman problem (Trp), a tour must be found through every one of a set of points (cities) in some metric space such that the weighted sum of completion times of ...
Sven Oliver Krumke, Willem de Paepe, Diana Poensge...
KDD
2006
ACM
142views Data Mining» more  KDD 2006»
15 years 10 months ago
Mining distance-based outliers from large databases in any metric space
Let R be a set of objects. An object o R is an outlier, if there exist less than k objects in R whose distances to o are at most r. The values of k, r, and the distance metric ar...
Yufei Tao, Xiaokui Xiao, Shuigeng Zhou