200 search results - page 25 / 40 » Approximation Algorithms for Scheduling on Multiple Machines |
133
Voted
CDC
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract— A distributed online learning framework for support vector machines (SVMs) is presented and analyzed. First, the generic binary classification problem is decomposed in...
121
Voted
DAM
2007
15 years 2 months ago
2007
In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...
119
Voted
EDBT
2008
ACM
16 years 2 months ago
2008
ACM
Data Stream Management Systems (DSMSs) must support optimized execution scheduling of multiple continuous queries on massive, and frequently bursty, data streams. Previous approac...
150
click to vote
ACCV
2007
Springer
15 years 9 months ago
2007
Springer
Camera networks are increasingly being deployed for security. In most of these camera networks, video sequences are captured, transmitted and archived continuously from all cameras...
105
Voted
COLT
1993
Springer
15 years 6 months ago
1993
Springer
We introduce a new formal model in which a learning algorithm must combine a collection of potentially poor but statistically independent hypothesis functions in order to approxima...