Sciweavers

4117 search results - page 513 / 824
» On the Satisfiability of Complex Constraints
Sort
View
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
16 years 7 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
ICCAD
2004
IEEE
155views Hardware» more  ICCAD 2004»
16 years 3 months ago
A flexibility aware budgeting for hierarchical flow timing closure
—In this paper, we present a new block budgeting algorithm which speeds up timing closure in timing driven hierarchical flows. After a brief description of the addressed flow, ...
Olivier Omedes, Michel Robert, Mohammed Ramdani
ICRA
2002
IEEE
187views Robotics» more  ICRA 2002»
15 years 11 months ago
Trajectory Planning using Reachable-State Density Functions
:This paper presents a trajectory planning algorithm for mobile robots which may be subject to kinodynamic constraints. Using computational methods from noncommutative harmonic ana...
Richard Mason, Joel W. Burdick
247
Voted
UIST
1993
ACM
15 years 11 months ago
VB2: An Architecture for Interaction in Synthetic Worlds
This paper describes the VB2 architecture for the construction of three-dimensional interactive applications. The system's state and behavior are uniformly represented as a n...
Enrico Gobbetti, Jean-Francis Balaguer, Daniel Tha...
CSFW
2004
IEEE
15 years 10 months ago
Cassandra: Flexible Trust Management, Applied to Electronic Health Records
We study the specification of access control policy in large-scale distributed systems. We present Cassandra, a language and system for expressing policy, and the results of a sub...
Moritz Y. Becker, Peter Sewell