Sciweavers

2111 search results - page 170 / 423
» Understanding the Yarowsky Algorithm
Sort
View
CADE
2008
Springer
15 years 10 months ago
Automata-Based Axiom Pinpointing
Axiom pinpointing has been introduced in description logics (DL) to help the user understand the reasons why consequences hold by computing minimal subsets of the knowledge base th...
Franz Baader, Rafael Peñaloza
CCS
2009
ACM
15 years 4 months ago
A probabilistic approach to hybrid role mining
Role mining algorithms address an important access control problem: configuring a role-based access control system. Given a direct assignment of users to permissions, role mining...
Mario Frank, Andreas P. Streich, David A. Basin, J...
GECCO
2009
Springer
148views Optimization» more  GECCO 2009»
15 years 4 months ago
Multiplicative approximations and the hypervolume indicator
Indicator-based algorithms have become a very popular approach to solve multi-objective optimization problems. In this paper, we contribute to the theoretical understanding of alg...
Tobias Friedrich, Christian Horoba, Frank Neumann
ICRA
2008
IEEE
134views Robotics» more  ICRA 2008»
15 years 4 months ago
Real-time learning of resolved velocity control on a Mitsubishi PA-10
Abstract— Learning inverse kinematics has long been fascinating the robot learning community. While humans acquire this transformation to complicated tool spaces with ease, it is...
Jan Peters, Duy Nguyen-Tuong
AAECC
2007
Springer
109views Algorithms» more  AAECC 2007»
15 years 4 months ago
The Tangent FFT
The split-radix FFT computes a size-n complex DFT, when n is a large power of 2, using just 4n lg n−6n+8 arithmetic operations on real numbers. This operation count was first an...
Daniel J. Bernstein