Sciweavers

1139 search results - page 107 / 228
» Bounded Ideation Theory
Sort
View
ADCM
2000
45views more  ADCM 2000»
13 years 7 months ago
Training neural networks with noisy data as an ill-posed problem
This paper is devoted to the analysis of network approximation in the framework of approximation and regularization theory. It is shown that training neural networks and similar n...
Martin Burger, Heinz W. Engl
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 6 months ago
Performance Evaluation of Components Using a Granularity-based Interface Between Real-Time Calculus and Timed Automata
nalysis of a TA modeled component. First, we abstract fine models to work with event streams at coarse granularity. We perform analysis of the component at multiple coarse granular...
Karine Altisen, Yanhong Liu, Matthieu Moy
JDA
2010
122views more  JDA 2010»
13 years 2 months ago
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
Ignasi Sau, Dimitrios M. Thilikos
COMBINATORICA
2011
12 years 7 months ago
Binary subtrees with few labeled paths
We prove several quantitative Ramseyan results involving ternary complete trees with {0, 1}-labeled edges where we attempt to find a complete binary subtree with as few labels as ...
Rodney G. Downey, Noam Greenberg, Carl G. Jockusch...
CVPR
2000
IEEE
14 years 10 months ago
On the Number of Samples Needed in Light Field Rendering with Constant-Depth Assumption
While several image-based rendering techniques have been proposed to successfully render scenes/objects from a large collection (e.g., thousands) of images without explicitly reco...
Zhouchen Lin, Heung-Yeung Shum