5214 search results - page 164 / 1043 » The Online Specialization Problem |
127
click to vote
LREC
2010
15 years 5 months ago
2010
As the data for more and more languages is finding its way into digital form, with an increasing amount of this data being posted to the Web, it has become possible to collect lan...
136
click to vote
ICPR
2004
IEEE
16 years 5 months ago
2004
IEEE
In this paper, we investigate the problem of automatic audio surveillance. This aspect of the surveillance, which extends the more investigated area of video surveillance, can be ...
150
click to vote
ICML
2003
IEEE
16 years 4 months ago
2003
IEEE
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
105
click to vote
ICSE
2004
IEEE-ACM
16 years 4 months ago
2004
IEEE-ACM
Achieving high dependability of Web Services (WSs) dynamically composed from component WSs is an open problem. One of the main difficulties here is due to the fact that the compone...
244
click to vote
WADS
2009
Springer
15 years 10 months ago
2009
Springer
We analyze the problem of packing squares in an online fashion: Given an semi-infinite strip of width 1 and an unknown sequence of squares with side lengths in [0, 1] that arrive...