Sciweavers

2177 search results - page 76 / 436
» Relative Margin Machines
Sort
View
ADC
2004
Springer
87views Database» more  ADC 2004»
14 years 1 months ago
On the Computation of Approximations of Database Queries
Reflective Relational Machines were introduced by S. Abiteboul, C. Papadimitriou and V. Vianu in 1994, as variations of Turing machines which are suitable for the computation of ...
Flavio Antonio Ferrarotti, Jose Maria Turull Torre...
MICRO
2008
IEEE
93views Hardware» more  MICRO 2008»
13 years 7 months ago
What Kinds of Computer-Software-Related Advances (if Any) Are Eligible for Patents? Part II: The "Useful Arts" Requirement
of nature, or abstract idea (collectively, a principle). The clue to the patent-eligibility of processes that do not involve substance-transformation is whether the process impleme...
Richard Stern
CAAN
2007
Springer
13 years 11 months ago
Preemptive Scheduling on Selfish Machines
We consider the problem of scheduling on parallel uniformly related machines, where preemptions are allowed and the machines are controlled by selfish agents. Our goal is to minimi...
Leah Epstein, Rob van Stee
BIOID
2008
110views Biometrics» more  BIOID 2008»
13 years 9 months ago
An Empirical Comparison of Individual Machine Learning Techniques in Signature and Fingerprint Classification
This paper describes an empirical study to investigate the performance of a wide range of classifiers deployed in applications to classify biometric data. The study specifically re...
Marjory C. C. Abreu, Michael C. Fairhurst
BMCBI
2006
91views more  BMCBI 2006»
13 years 7 months ago
Empirical study of supervised gene screening
Background: Microarray studies provide a way of linking variations of phenotypes with their genetic causations. Constructing predictive models using high dimensional microarray me...
Shuangge Ma