6315 search results - page 147 / 1263 » Approximating Solution Structure |
202
click to vote
TNN
2010
15 years 1 months ago
2010
Abstract--Recently, sparse approximation has become a preferred method for learning large scale kernel machines. This technique attempts to represent the solution with only a subse...
145
click to vote
RSCTC
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Many learning methods ignore domain knowledge in synthesis of concept approximation. We propose to use hierarchical schemes for learning approximations of complex concept...
140
click to vote
CG
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. A one-player, finite, probabilistic game with perfect information can be presented as a bipartite graph. For one-player Can't Stop, the graph is cyclic and the chall...
138
click to vote
UAI
2000
15 years 7 months ago
2000
Monitoring plan preconditions can allow for replanning when a precondition fails, generally far in advance of the point in the plan where the precondition is relevant. However, mo...
175
click to vote
IPCO
1993
15 years 7 months ago
1993
The survivable network design problem (SNDP) is to construct a minimum-cost subgraph satisfying certain given edge-connectivity requirements. The first polynomial-time approximati...