Sciweavers

765 search results - page 11 / 153
» Empirical Design of Geometric Algorithms
Sort
View
ICML
2008
IEEE
14 years 8 months ago
Empirical Bernstein stopping
Sampling is a popular way of scaling up machine learning algorithms to large datasets. The question often is how many samples are needed. Adaptive stopping algorithms monitor the ...
Csaba Szepesvári, Jean-Yves Audibert, Volod...
JVCIR
2006
85views more  JVCIR 2006»
13 years 7 months ago
Combining geometrical and textured information to perform image classification
In this paper, we propose a framework to carry out supervised classification of images containing both textured and non textured areas. Our approach is based on active contours. U...
Jean-François Aujol, Tony F. Chan
KDD
1997
ACM
104views Data Mining» more  KDD 1997»
13 years 11 months ago
Proposal and Empirical Comparison of a Parallelizable Distance-Based Discretization Method
Many classification algorithms are designed to work with datasets that contain only discrete attributes. Discretization is the process of converting the continuous attributes of ...
Jesús Cerquides, Ramon López de M&aa...
ESA
2004
Springer
117views Algorithms» more  ESA 2004»
14 years 24 days ago
Classroom Examples of Robustness Problems in Geometric Computations
The algorithms of computational geometry are designed for a machine model with exact real arithmetic. Substituting floating-point arithmetic for the assumed real arithmetic may c...
Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan ...
IROS
2008
IEEE
141views Robotics» more  IROS 2008»
14 years 1 months ago
Geometrical workspace analysis of a cable-driven redundant parallel manipulator: KNTU CDRPM
— KNTU CDRPM is a cable driven redundant parallel manipulator, which is under investigation for possible high speed and large workspace applications. This newly developed mechani...
Mohammad M. Aref, Hamid D. Taghirad