Sciweavers

1139 search results - page 14 / 228
» Bounded Ideation Theory
Sort
View
ALT
2006
Springer
14 years 4 months ago
Large-Margin Thresholded Ensembles for Ordinal Regression: Theory and Practice
Abstract. We propose a thresholded ensemble model for ordinal regression problems. The model consists of a weighted ensemble of confidence functions and an ordered vector of thres...
Hsuan-Tien Lin, Ling Li
CIE
2006
Springer
13 years 11 months ago
Forcing with Random Variables and Proof Complexity
or representation theory of groups), and even borrows abstract geometrical concepts like Euler characteristic or Grothendieck ring. However, the most stimulating for proof complexi...
Jan Krajícek
LICS
2008
IEEE
14 years 2 months ago
On the Computational Complexity of Cut-Reduction
Using appropriate notation systems for proofs, cutreduction can often be rendered feasible on these notations. Explicit bounds can be given. Developing a suitable notation system ...
Klaus Aehlig, Arnold Beckmann
ICALP
1999
Springer
13 years 12 months ago
Average-Case Complexity of Shellsort
We demonstrate an ⍀( pn1ϩ1/p) lower bound on the average-case running time (uniform distribution) of p-pass Shellsort. This is the first nontrivial general lower bound for avera...
Tao Jiang, Ming Li, Paul M. B. Vitányi
JSYML
2002
81views more  JSYML 2002»
13 years 7 months ago
Group Configurations and Germs in Simple Theories
We develop the theory of germs of generic functions in simple theories. Starting with an algebraic quadrangle (or other similar hypotheses), we obtain an "almost" generic...
Itay Ben-Yaacov