2925 search results - page 79 / 585 » Information Complexity of Online Problems |
155
click to vote
ELPUB
1999
ACM
15 years 10 months ago
1999
ACM
Internet based services, particularly asynchronous communication services, offer an environment suited to the rise of knowledge communities. Knowledge communities, or invisible co...
147
Voted
NIPS
1992
15 years 7 months ago
1992
In visual processing the ability to deal with missing and noisy information is crucial. Occlusions and unreliable feature detectors often lead to situations where little or no dir...
137
click to vote
CCA
2009
Springer
16 years 22 days ago
2009
Springer
It is folklore particularly in numerical and computer sciences that, instead of solving some general problem f : A → B, additional structural information about the input x ∈ A ...
172
click to vote
SOFSEM
2010
Springer
16 years 3 months ago
2010
Springer
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
162
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
Single 2D line drawing is a straightforward method to illustrate 3D objects. The faces of an object depicted by a line drawing give very useful information for the reconstruction ...