Sciweavers

1029 search results - page 57 / 206
» Compact representations of ordered sets
Sort
View
ISMVL
2010
IEEE
158views Hardware» more  ISMVL 2010»
15 years 7 months ago
An Evolutionary Algorithm for Optimization of Pseudo Kronecker Expressions
—Using EXOR gates in logic synthesis often results in smaller circuit realizations. While in AND/OR synthesis the problem definition is clear, in AND/EXOR synthesis several clas...
Alexander Finder, Rolf Drechsler
AAAI
2004
15 years 4 months ago
Extending CP-Nets with Stronger Conditional Preference Statements
A logic of conditional preferences is defined, with a language which allows the compact representation of certain kinds of conditional preference statements, a semantics and a pro...
Nic Wilson
WSCG
2004
139views more  WSCG 2004»
15 years 4 months ago
Extraction of Volumetric Structures in an Illuminance Image
An original method is proposed to extract the most significant volumetric structures in an illuminance image. The method proceeds in three levels of organization managed by generi...
Marielle Mokhtari, Robert Bergevin
JCIT
2010
174views more  JCIT 2010»
14 years 10 months ago
Efficient Ming of Top-K Closed Sequences
Sequence mining is an important data mining task. In order to retrieve interesting sequences from a large database, a minimum support threshold is needed to be specified. Unfortun...
Panida Songram
NIPS
1994
15 years 4 months ago
Finding Structure in Reinforcement Learning
Reinforcement learning addresses the problem of learning to select actions in order to maximize one's performance inunknownenvironments. Toscale reinforcement learning to com...
Sebastian Thrun, Anton Schwartz