3250 search results - page 25 / 650 » Parameterized Learning Complexity |
100
Voted
ICML
2001
IEEE
16 years 3 months ago
2001
IEEE
We call data weakly labeled if it has no exact label but rather a numerical indication of correctness of the label "guessed" by the learning algorithm - a situation comm...
145
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
123
click to vote
CVPR
1999
IEEE
16 years 4 months ago
1999
IEEE
A spatio-temporal representation for complex optical flow events is developed that generalizes traditional parameterized motion models (e.g. affine). These generative spatio-tempo...
118
click to vote
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
VTC
2006
IEEE
15 years 8 months ago
2006
IEEE
— Mobility models are widely used in simulation-based performance analyses of mobile networks. However, there is a trade-off between simplicity and realistic movement patterns. S...