Sciweavers

4103 search results - page 301 / 821
» Some results on the Collatz problem
Sort
View
DAC
1998
ACM
16 years 7 months ago
Approximation and Decomposition of Binary Decision Diagrams
Efficient techniques for the manipulation of Binary Decision Diagrams (BDDs) are key to the success of formal verification tools. Recent advances in reachability analysis and mode...
Kavita Ravi, Kenneth L. McMillan, Thomas R. Shiple...
ICML
2005
IEEE
16 years 7 months ago
Predicting relative performance of classifiers from samples
This paper is concerned with the problem of predicting relative performance of classification algorithms. It focusses on methods that use results on small samples and discusses th...
Rui Leite, Pavel Brazdil
SIGMOD
2004
ACM
112views Database» more  SIGMOD 2004»
16 years 7 months ago
Matching Large XML Schemas
Current schema matching approaches still have to improve for very large and complex schemas. Such schemas are increasingly written in the standard language W3C XML schema, especia...
Erhard Rahm, Hong Hai Do, Sabine Massmann
ALT
2006
Springer
16 years 3 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

Publication
417views
16 years 3 months ago
Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces
We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximate...
Peter N. Yianilos