Sciweavers

11862 search results - page 75 / 2373
» Relative information completeness
Sort
View
STACS
1999
Springer
13 years 12 months ago
A Complete and Tight Average-Case Analysis of Learning Monomials
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
Rüdiger Reischuk, Thomas Zeugmann
ALP
1992
Springer
13 years 11 months ago
On the Relation Between Primitive Recursion, Schematization and Divergence
The paper presents a new schematization of in nite families of terms called the primal grammars, based on the notion of primitive recursive rewrite systems. This schematization is...
Miki Hermann
SIAMCO
2000
99views more  SIAMCO 2000»
13 years 7 months ago
Spectral Analysis of Fokker--Planck and Related Operators Arising From Linear Stochastic Differential Equations
We study spectral properties of certain families of linear second-order differential operators arising from linear stochastic differential equations. We construct a basis in the Hi...
Daniel Liberzon, Roger W. Brockett
CIKM
2005
Springer
14 years 1 months ago
QED: a novel quaternary encoding to completely avoid re-labeling in XML updates
The method of assigning labels to the nodes of the XML tree is called a labeling scheme. Based on the labels only, both ordered and un-ordered queries can be processed without acc...
Changqing Li, Tok Wang Ling
LPAR
2005
Springer
14 years 1 months ago
Another Complete Local Search Method for SAT
Local search algorithms are one of the effective methods for solving hard combinatorial problems. However, a serious problem of this approach is that the search often traps at loca...
Haiou Shen, Hantao Zhang