2252 search results - page 211 / 451 » Lower Bounds for Dynamic Algorithms |
135
Voted
ORDER
2007
15 years 3 months ago
2007
On-line chain partitioning problem of on-line posets has been open for the past 20 years. The best known on-line algorithm uses 5w −1 4 chains to cover poset of width w. Felsner ...
203
click to vote
APPROX
2011
Springer
14 years 3 months ago
2011
Springer
In this work we consider the problem of approximating the number of relevant variables in a function given query access to the function. Since obtaining a multiplicative factor ap...
257
click to vote
PVLDB
2011
14 years 10 months ago
2011
With the recent surge of social networks such as Facebook, new forms of recommendations have become possible – recommendations that rely on one’s social connections in order t...
175
Voted
JMLR
2012
13 years 6 months ago
2012
Contextual bandit learning is a reinforcement learning problem where the learner repeatedly receives a set of features (context), takes an action and receives a reward based on th...
156
click to vote
ICCV
2003
IEEE
16 years 5 months ago
2003
IEEE
Human identification at a distance has recently gained growing interest from computer vision researchers. This paper aims to propose a visual recognition algorithm based upon fusi...