Sciweavers

4196 search results - page 728 / 840
» Unsupervised Learning of Relations
Sort
View
STACS
2010
Springer
15 years 8 months ago
A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
Rustem Takhanov
128
Voted
ITNG
2010
IEEE
15 years 8 months ago
A Fast and Stable Incremental Clustering Algorithm
— Clustering is a pivotal building block in many data mining applications and in machine learning in general. Most clustering algorithms in the literature pertain to off-line (or...
Steven Young, Itamar Arel, Thomas P. Karnowski, De...
EICS
2010
ACM
15 years 8 months ago
Using ensembles of decision trees to automate repetitive tasks in web applications
Web applications such as web-based email, spreadsheets and form filling applications have become ubiquitous. However, many of the tasks that users try to accomplish with such web ...
Zachary Bray, Per Ola Kristensson
ACSAC
2002
IEEE
15 years 8 months ago
Thirty Years Later: Lessons from the Multics Security Evaluation
Almost thirty years ago a vulnerability assessment of Multics identified significant vulnerabilities, despite the fact that Multics was more secure than other contemporary (and cu...
Paul A. Karger, Roger R. Schell
125
Voted
ICRA
2002
IEEE
128views Robotics» more  ICRA 2002»
15 years 8 months ago
Generation of a Task Model by Integrating Multiple Observations of Human Demonstrations
This paper describes a new approach on how to teach a robot everyday manipulation tasks under the “Learning from Observation” framework. Most of the approaches so far assume t...
Koichi Ogawara, Jun Takamatsu, Hiroshi Kimura, Kat...