Sciweavers

10608 search results - page 1967 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
DLOG
2006
13 years 11 months ago
Tableau Caching for Description Logics with Inverse and Transitive Roles
Abstract. Modern description logic (DL) reasoners are known to be less efficient for DLs with inverse roles. The current loss of performance is largely due to the missing applicabi...
Yu Ding, Volker Haarslev
VMV
2004
185views Visualization» more  VMV 2004»
13 years 11 months ago
Convexification of Unstructured Grids
Unstructured tetrahedral grids are a common data representation of three-dimensional scalar fields. For convex unstructured meshes efficient rendering methods are known. For conca...
Stefan Röttger, Stefan Guthe, Andreas Schiebe...
SODA
2003
ACM
114views Algorithms» more  SODA 2003»
13 years 11 months ago
Lower bounds for collusion-secure fingerprinting
Collusion-secure fingerprinting codes are an important primitive used by many digital watermarking schemes [1, 10, 9]. Boneh and Shaw [3] define a model for these types of codes...
Chris Peikert, Abhi Shelat, Adam Smith
FLAIRS
1998
13 years 11 months ago
Analytical Design of Reinforcement Learning Tasks
Reinforcement learning (RL) problems constitute an important class of learning and control problems faced by artificial intelligence systems. In these problems, one is faced with ...
Robert E. Smith
NIPS
1989
13 years 11 months ago
The Cascade-Correlation Learning Architecture
Cascade-Correlation is a new architecture and supervised learning algorithm for artificial neural networks. Instead of just adjusting the weights in a network of fixed topology,...
Scott E. Fahlman, Christian Lebiere
« Prev « First page 1967 / 2122 Last » Next »