Sciweavers

1661 search results - page 123 / 333
» Decision Tree Fields
Sort
View
AISC
2008
Springer
15 years 8 months ago
MetiTarski: An Automatic Prover for the Elementary Functions
Many inequalities involving the functions ln, exp, sin, cos, etc., can be proved automatically by MetiTarski: a resolution theorem prover (Metis) modified to call a decision proced...
Behzad Akbarpour, Lawrence C. Paulson
STANDARDVIEW
1998
128views more  STANDARDVIEW 1998»
15 years 6 months ago
Compatibility, standards, and software production
Compatibility is a key strategic decision in software production. Proposals exist for standards in several fields of software production, such as networking (ISO and IEEE), operat...
Giancarlo Succi, Andrea Valerio, Tullio Vernazza, ...
PRL
2008
213views more  PRL 2008»
15 years 6 months ago
Boosting recombined weak classifiers
Boosting is a set of methods for the construction of classifier ensembles. The differential feature of these methods is that they allow to obtain a strong classifier from the comb...
Juan José Rodríguez, Jesús Ma...
ICIP
2008
IEEE
16 years 25 days ago
MAP-MRF approach for binarization of degraded document image
We propose an algorithm for the binarization of document images degraded by uneven light distribution, based on the Markov Random Field modeling with Maximum A Posteriori probabil...
Jung Gap Kuk, Nam Ik Cho, Kyoung Mu Lee
FOCS
2006
IEEE
16 years 13 days ago
Generalization of Binary Search: Searching in Trees and Forest-Like Partial Orders
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
Krzysztof Onak, Pawel Parys