Sciweavers

10051 search results - page 288 / 2011
» A Dynamic Separator Algorithm
Sort
View
ICDE
2000
IEEE
110views Database» more  ICDE 2000»
16 years 8 months ago
A Novel Deadline Driven Disk Scheduling Algorithm for Multi-Priority Multimedia Objects
In this paper we introduce a new deadline driven disk scheduling algorithm designed for multimedia servers. The proposed algorithm supports real time requests with multiple priori...
Ibrahim Kamel, T. Niranjan, Shahram Ghandeharizade...
MMM
2006
Springer
154views Multimedia» more  MMM 2006»
16 years 24 days ago
A robust object shape prediction algorithm in the presence of white Gaussian noise
This paper presents a shape prediction algorithm in a noisy video sequence based on pixel representation in the undecimated wavelet domain. In our algorithm for tracking of user-d...
Mohammad Khansari, Hamid R. Rabiee, M. Asadi, M. G...
LION
2010
Springer
190views Optimization» more  LION 2010»
15 years 10 months ago
Algorithm Selection as a Bandit Problem with Unbounded Losses
Abstract. Algorithm selection is typically based on models of algorithm performance learned during a separate offline training sequence, which can be prohibitively expensive. In r...
Matteo Gagliolo, Jürgen Schmidhuber
NIPS
2007
15 years 8 months ago
Boosting Algorithms for Maximizing the Soft Margin
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....
Manfred K. Warmuth, Karen A. Glocer, Gunnar Rä...
TCS
2008
15 years 6 months ago
Algorithms for subsequence combinatorics
A subsequence is obtained from a string by deleting any number of characters; thus in contrast to a substring, a subsequence is not necessarily a contiguous part of the string. Co...
Cees H. Elzinga, Sven Rahmann, Hui Wang