2925 search results - page 33 / 585 » Information Complexity of Online Problems |
210
click to vote
JMLR
2012
13 years 8 months ago
2012
While determining model complexity is an important problem in machine learning, many feature learning algorithms rely on cross-validation to choose an optimal number of features, ...
155
click to vote
ICTIR
2009
Springer
16 years 5 days ago
2009
Springer
We address the problem of online term recurrence prediction: for a stream of terms, at each time point predict what term is going to recur next in the stream given the term occurre...
163
click to vote
LATIN
1998
Springer
15 years 9 months ago
1998
Springer
The reconstruction of a shape or surface from a finite set of points is a practically significant and theoretically challenging problem. This paper presents a unified view of algor...
159
click to vote
STOC
2009
ACM
16 years 6 months ago
2009
ACM
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
123
click to vote
IADIS
2003
15 years 7 months ago
2003
Online publications are becoming an important information source. Due to the variety of standards and other forms of best practices used in composing online publications, preserva...