Sciweavers

1101 search results - page 186 / 221
» Forcing in proof theory
Sort
View
ENTCS
2002
128views more  ENTCS 2002»
13 years 8 months ago
Rewriting Calculus with(out) Types
The last few years have seen the development of a new calculus which can be considered as an outcome of the last decade of various researches on (higher order) term rewriting syst...
Horatiu Cirstea, Claude Kirchner, Luigi Liquori
SIAMCO
2000
75views more  SIAMCO 2000»
13 years 8 months ago
Generic Simplicity of the Spectrum and Stabilization for a Plate Equation
In this work we prove the generic simplicity of the spectrum of the clamped plate equation in a bounded regular domain of Rd. That is, given Rd, we show that there exists an arbi...
Jaime H. Ortega, Enrique Zuazua
DATAMINE
1998
145views more  DATAMINE 1998»
13 years 8 months ago
A Tutorial on Support Vector Machines for Pattern Recognition
The tutorial starts with an overview of the concepts of VC dimension and structural risk minimization. We then describe linear Support Vector Machines (SVMs) for separable and non-...
Christopher J. C. Burges
ISI
2002
Springer
13 years 8 months ago
Getting right answers from incomplete multidimensional databases
Dealing with large volumes of data, OLAP data cubes aggregated values are often spoiled by errors due to missing values in detailed data. This paper suggests to adjust aggregate an...
Sabine Goutier, Georges Hébrail, Vér...
ML
2002
ACM
141views Machine Learning» more  ML 2002»
13 years 8 months ago
On the Existence of Linear Weak Learners and Applications to Boosting
We consider the existence of a linear weak learner for boosting algorithms. A weak learner for binary classification problems is required to achieve a weighted empirical error on t...
Shie Mannor, Ron Meir