Sciweavers

499 search results - page 73 / 100
» Decision Trees for Functional Variables
Sort
View
CC
2010
Springer
120views System Software» more  CC 2010»
13 years 5 months ago
Lower Bounds for Agnostic Learning via Approximate Rank
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose that t...
Adam R. Klivans, Alexander A. Sherstov

Book
688views
15 years 5 months ago
Database Management Systems
A set of presentations covering the book, which includes the following topics ER Model and Conceptual Design, The Relational Model and SQL DDL, Relational Algebra, SQL, Database Ap...
Raghu Ramakrishnan, Johannes Gehrke
IFIP
2005
Springer
14 years 1 months ago
Multi-Stage Stochastic Electricity Portfolio Optimization in Liberalized Energy Markets
In this paper we analyze the electricity portfolio problem of a big consumer in a multi-stage stochastic programming framework. Stochasticity enters the model via the uncertain spo...
Ronald Hochreiter, Georg Ch. Pflug, David Wozabal
FOCS
2003
IEEE
14 years 1 months ago
Learning DNF from Random Walks
We consider a model of learning Boolean functions from examples generated by a uniform random walk on {0, 1}n . We give a polynomial time algorithm for learning decision trees and...
Nader H. Bshouty, Elchanan Mossel, Ryan O'Donnell,...
PLILP
1993
Springer
13 years 11 months ago
A Demand Driven Computation Strategy for Lazy Narrowing
Many recent proposals for the integration of functional and logic programming use conditional term rewriting systems (CTRS) as programs and narrowing as goal solving mechanism. Thi...
Rita Loogen, Francisco Javier López-Fraguas...