5214 search results - page 239 / 1043 » The Online Specialization Problem |
311
click to vote
Publication
In this paper, we address the problem of automatically detecting and tracking a variable number of persons in complex
scenes using a monocular, potentially moving, uncalibrated ca...
161
click to vote
AMAI
2008
Springer
15 years 6 months ago
2008
Springer
This paper discusses the problem of building efficient coverage paths for a team of robots. An efficient multi-robot coverage algorithm should result in a coverage path for every ...
209
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
—It is well known that Online Social Networks (OSNs) are vulnerable to privacy leakages, whereby specific information about a user (political affiliation, sexual orientation, g...
185
click to vote
ICDT
2005
ACM
16 years 5 days ago
2005
ACM
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
183
click to vote
COLT
1999
Springer
15 years 11 months ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...