93 search results - page 3 / 19 » Information-Based Nonlinear Approximation: An Average Case S... |
100
click to vote
APPROX
2009
Springer
15 years 6 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
138
click to vote
ALT
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
119
Voted
ICALP
2009
Springer
15 years 12 months ago
2009
Springer
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
JGO
2008
14 years 11 months ago
2008
This article complements the paper [7], where we showed that a compact feasible set of a standard semi-infinite optimization problem can be approximated arbitrarily well by a leve...
103
click to vote
FGR
2006
IEEE
15 years 3 months ago
2006
IEEE
Non-linear subspaces derived using kernel methods have been found to be superior compared to linear subspaces in modeling or classification tasks of several visual phenomena. Such...