Sciweavers

229 search results - page 24 / 46
» Proving Bounds on Real-Valued Functions with Computations
Sort
View
CSL
2004
Springer
15 years 1 months ago
Pfaffian Hybrid Systems
It is well known that in an o-minimal hybrid system the continuous and discrete components can be separated, and therefore the problem of finite bisimulation reduces to the same pr...
Margarita V. Korovina, Nicolai Vorobjov
JMLR
2006
143views more  JMLR 2006»
14 years 10 months ago
Consistency and Convergence Rates of One-Class SVMs and Related Algorithms
We determine the asymptotic behaviour of the function computed by support vector machines (SVM) and related algorithms that minimize a regularized empirical convex loss function i...
Régis Vert, Jean-Philippe Vert
ICALP
2007
Springer
15 years 4 months ago
Unbounded-Error One-Way Classical and Quantum Communication Complexity
This paper studies the gap between classical one-way communication complexity C(f) and its quantum counterpart Q(f), under the unbounded-error setting, i.e., it is enough that the ...
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Sh...
POPL
2008
ACM
15 years 10 months ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume
TEC
2010
173views more  TEC 2010»
14 years 4 months ago
Analysis of Computational Time of Simple Estimation of Distribution Algorithms
Estimation of distribution algorithms (EDAs) are widely used in stochastic optimization. Impressive experimental results have been reported in the literature. However, little work ...
Tianshi Chen, Ke Tang, Guoliang Chen, Xin Yao