Sciweavers

592 search results - page 82 / 119
» Learning Generalized Plans Using Abstract Counting
Sort
View
ECAI
2000
Springer
14 years 25 days ago
Naive Bayes and Exemplar-based Approaches to Word Sense Disambiguation Revisited
Abstract. This paper describes an experimental comparison between two standard supervised learning methods, namely Naive Bayes and Exemplar–basedclassification, on the Word Sens...
Gerard Escudero, Lluís Màrquez, Germ...
COLT
2005
Springer
14 years 2 months ago
A New Perspective on an Old Perceptron Algorithm
Abstract. We present a generalization of the Perceptron algorithm. The new algorithm performs a Perceptron-style update whenever the margin of an example is smaller than a predefi...
Shai Shalev-Shwartz, Yoram Singer
HRI
2009
ACM
14 years 3 months ago
How to approach humans?: strategies for social robots to initiate interaction
This paper proposes a model of approach behavior with which a robot can initiate conversation with people who are walking. We developed the model by learning from the failures in ...
Satoru Satake, Takayuki Kanda, Dylan F. Glas, Mich...
CIE
2007
Springer
14 years 2 months ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
13 years 10 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals