1298 search results - page 97 / 260 » The online set cover problem |
159
click to vote
CCCG
1993
15 years 7 months ago
1993
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...
176
click to vote
SAC
2009
ACM
16 years 1 months ago
2009
ACM
Online feedback-based rating systems are gaining popularity. Dealing with collaborative unfair ratings in such systems has been recognized as an important but difficult problem. T...
198
click to vote
ESCAPE
2007
Springer
16 years 18 days ago
2007
Springer
Abstract. In the online capacitated interval coloring problem, a sequence of requests arrive online. Each of the requests is an interval Ij ⊆ {1, 2, . . . , n} with bandwidth bj....
185
click to vote
CAAN
2007
Springer
15 years 10 months ago
2007
Springer
We study the efficiency of selfish routing problems in which traffic demands are revealed online. We go beyond the common Nash equilibrium concept in which possibly all players rer...
160
click to vote
ICPR
2004
IEEE
16 years 7 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 ...