Sciweavers

670 search results - page 53 / 134
» Brain-Like Approximate Reasoning
Sort
View
WWW
2007
ACM
14 years 10 months ago
Just the right amount: extracting modules from ontologies
The ability to extract meaningful fragments from an ontology is key for ontology re-use. We propose a definition of a module that guarantees to completely capture the meaning of a...
Bernardo Cuenca Grau, Ian Horrocks, Yevgeny Kazako...
ICRA
2008
IEEE
170views Robotics» more  ICRA 2008»
14 years 4 months ago
Fast grasp planning for hand/arm systems based on convex model
— This paper discusses the grasp planning of a multifingered hand attached at the tip of a robotic arm. By using the convex models and the new approximation method of the fricti...
Kensuke Harada, Kenji Kaneko, Fumio Kanehiro
FOCS
2000
IEEE
14 years 2 months ago
Fast parallel circuits for the quantum Fourier transform
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...
Richard Cleve, John Watrous
STOC
1999
ACM
176views Algorithms» more  STOC 1999»
14 years 2 months ago
On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
Johannes Blömer, Jean-Pierre Seifert
EMO
2006
Springer
158views Optimization» more  EMO 2006»
14 years 1 months ago
The Hypervolume Indicator Revisited: On the Design of Pareto-compliant Indicators Via Weighted Integration
The design of quality measures for approximations of the Pareto-optimal set is of high importance not only for the performance assessment, but also for the construction of multiobj...
Eckart Zitzler, Dimo Brockhoff, Lothar Thiele