Sciweavers

4255 search results - page 668 / 851
» On Learning Boolean Functions
Sort
View
COLT
2008
Springer
13 years 10 months ago
On the Equivalence of Weak Learnability and Linear Separability: New Relaxations and Efficient Boosting Algorithms
Boosting algorithms build highly accurate prediction mechanisms from a collection of lowaccuracy predictors. To do so, they employ the notion of weak-learnability. The starting po...
Shai Shalev-Shwartz, Yoram Singer
AAAI
2010
13 years 9 months ago
A Layered Approach to People Detection in 3D Range Data
People tracking is a key technology for autonomous systems, intelligent cars and social robots operating in populated environments. What makes the task difficult is that the appea...
Luciano Spinello, Kai Oliver Arras, Rudolph Triebe...
COMMA
2008
13 years 9 months ago
Requirements for reflective argument visualization tools: A Case for Using Validity as a Normative Standard
This paper formulates in the first part some requirements for a certain sort of computational argumentation systems, namely those which are designed for a very specific purpose: to...
Michael H. G. Hoffmann
LREC
2010
191views Education» more  LREC 2010»
13 years 9 months ago
Spatial Role Labeling: Task Definition and Annotation Scheme
One of the essential functions of natural language is to talk about spatial relationships between objects. Linguistic constructs can express highly complex, relational structures ...
Parisa KordJamshidi, Martijn van Otterlo, Marie-Fr...
EMNLP
2008
13 years 9 months ago
Stacking Dependency Parsers
We explore a stacked framework for learning to predict dependency structures for natural language sentences. A typical approach in graph-based dependency parsing has been to assum...
André F. T. Martins, Dipanjan Das, Noah A. ...