Sciweavers

3837 search results - page 33 / 768
» Learning Approximate Consistencies
Sort
View
102
Voted
DAM
2007
153views more  DAM 2007»
15 years 1 months ago
Computing the minimum number of hybridization events for a consistent evolutionary history
It is now well-documented that the structure of evolutionary relationships between a set of present-day species is not necessarily tree-like. The reason for this is that reticulat...
Magnus Bordewich, Charles Semple
FOCS
2009
IEEE
15 years 8 months ago
Agnostic Learning of Monomials by Halfspaces Is Hard
— We prove the following strong hardness result for learning: Given a distribution on labeled examples from the hypercube such that there exists a monomial (or conjunction) consi...
Vitaly Feldman, Venkatesan Guruswami, Prasad Ragha...
ICML
2010
IEEE
15 years 2 months ago
Toward Off-Policy Learning Control with Function Approximation
We present the first temporal-difference learning algorithm for off-policy control with unrestricted linear function approximation whose per-time-step complexity is linear in the ...
Hamid Reza Maei, Csaba Szepesvári, Shalabh ...
130
Voted
JMLR
2006
140views more  JMLR 2006»
15 years 1 months ago
Active Learning in Approximately Linear Regression Based on Conditional Expectation of Generalization Error
The goal of active learning is to determine the locations of training input points so that the generalization error is minimized. We discuss the problem of active learning in line...
Masashi Sugiyama
EWSN
2004
Springer
16 years 1 months ago
Context-Aware Sensors
Wireless sensor networks typically consist of a large number of sensor nodes embedded in a physical space. Such sensors are low-power devices that are primarily used for monitoring...
Eiman Elnahrawy, Badri Nath