Sciweavers

2661 search results - page 261 / 533
» Quantum Complexity Classes
Sort
View
IDEAS
1997
IEEE
93views Database» more  IDEAS 1997»
15 years 8 months ago
Schema Evolution in Object Databases by Catalogs
We are concerned by schema evolution in Object Oriented Databases (OODB) that is processed by a modification on the classes on the schema. We present a new categorization of the d...
Anne Pons, Rudolf K. Keller
COLT
2008
Springer
15 years 6 months ago
An Efficient Reduction of Ranking to Classification
This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most t...
Nir Ailon, Mehryar Mohri
UAI
2001
15 years 5 months ago
Efficient Stepwise Selection in Decomposable Models
In this paper, we present an efficient algorithm for performing stepwise selection in the class of decomposable models. We focus on the forward selection procedure, but we also di...
Amol Deshpande, Minos N. Garofalakis, Michael I. J...
IJCAI
1993
15 years 5 months ago
On the Polynomial Transparency of Resolution
In this paper a framework is developed for measuring the complexities of deductions in an ab­ stract and computationally perspicuous man­ ner. As a notion of central importance ...
Reinhold Letz
BMCBI
2008
111views more  BMCBI 2008»
15 years 4 months ago
MLIP: using multiple processors to compute the posterior probability of linkage
Background: Localization of complex traits by genetic linkage analysis may involve exploration of a vast multidimensional parameter space. The posterior probability of linkage (PP...
Manika Govil, Alberto Maria Segre, Veronica J. Vie...