11160 search results - page 246 / 2232 » Incompleteness in a General Setting |
158
click to vote
CORR
2004
Springer
15 years 5 months ago
2004
Springer
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
220
click to vote
MST
2010
15 years 18 days ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
169
click to vote
CRYPTO
2011
Springer
14 years 5 months ago
2011
Springer
Deterministic public-key encryption, introduced by Bellare, Boldyreva, and O’Neill (CRYPTO ’07), provides an alternative to randomized public-key encryption in various scenari...
176
click to vote
MOBIHOC
2008
ACM
16 years 5 months ago
2008
ACM
Dealing with interference is one of the primary challenges to solve in the design of protocols for wireless ad-hoc networks. Most of the work in the literature assumes localized o...
152
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
For object category recognition to scale beyond a small number of classes, it is important that algorithms be able to learn from a small amount of labeled data per additional clas...