Sciweavers

706 search results - page 79 / 142
» On a quasi-ordering on Boolean functions
Sort
View
ECCC
2011
183views ECommerce» more  ECCC 2011»
13 years 4 months ago
Extractors and Lower Bounds for Locally Samplable Sources
We consider the problem of extracting randomness from sources that are efficiently samplable, in the sense that each output bit of the sampler only depends on some small number d ...
Anindya De, Thomas Watson
DELTA
2002
IEEE
14 years 2 months ago
Minimization and Partitioning Method Reducing Input Sets
The article describes a new Boolean minimization and single-level partitioning method based on the BOOM minimization system [6]. The minimization is performed with respect to the ...
Jan Hlavicka, Petr Fiser
CAISE
2006
Springer
14 years 24 days ago
Modelling and Verifying of e-Commerce Systems
Static function hierarchies and models of the dynamic behaviour are typically used in e-commerce systems. Issues to be verifies are the completeness and correctness of the static f...
Andreas Speck
STOC
2005
ACM
138views Algorithms» more  STOC 2005»
14 years 2 months ago
A new strategy for querying priced information
This paper focuses on competitive function evaluation in the context of computing with priced information. A function f is given together with a cost cx for each variable x of f. ...
Ferdinando Cicalese, Eduardo Sany Laber

Book
796views
15 years 8 months ago
Introduction to Machine Learning
This is an introductory book about machine learning. Notice that this is a draft book. It may contain typos, mistakes, etc. The book covers the following topics: Boolean Functio...
Nils J. Nilsson