53 search results - page 7 / 11 » Chow's theorem for linear spaces |
ICML
2005
IEEE
14 years 11 months ago
2005
IEEE
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
TSP
2008
13 years 10 months ago
2008
One of the fundamental assumptions in traditional sampling theorems is that the signals to be sampled come from a single vector space (e.g. bandlimited functions). However, in many...
ICML
2000
IEEE
14 years 11 months ago
2000
IEEE
This paper presents a general method to derive tight rates of convergence for numerical approximations in optimal control when we consider variable resolution grids. We study the ...
MLG
2007
Springer
14 years 5 months ago
2007
Springer
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
DAC
1994
ACM
14 years 3 months ago
1994
ACM
We provide a new theoretical framework for constructing Steiner routing trees with minimum Elmore delay. Earlier work [3, 13] has established Elmore delay as a high delity estima...