1272 search results - page 92 / 255 » Approximate Parameterized Matching |
129
click to vote
SIAMCOMP
2000
15 years 3 months ago
2000
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
160
Voted
SIAMSC
2010
15 years 1 months ago
2010
We propose certified reduced basis methods for the efficient and reliable evaluation of a general output that is implicitly connected to a given parameterized input through the ha...
147
Voted
JMLR
2010
14 years 10 months ago
2010
We address an approximation method for Gaussian process (GP) regression, where we approximate covariance by a block matrix such that diagonal blocks are calculated exactly while o...
170
Voted
PDCAT
2005
Springer
15 years 9 months ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
156
click to vote
DISOPT
2010
15 years 3 months ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...