Sciweavers

1029 search results - page 19 / 206
» Compact representations of ordered sets
Sort
View
120
Voted
ECAI
2008
Springer
15 years 4 months ago
Advanced Preprocessing for Answer Set Solving
Abstract. We introduce the first substantial approach to preprocessing in the context of answer set solving. The idea is to simplify a logic program while identifying equivalences ...
Martin Gebser, Benjamin Kaufmann, André Neu...
DATE
2005
IEEE
126views Hardware» more  DATE 2005»
15 years 8 months ago
The Accidental Detection Index as a Fault Ordering Heuristic for Full-Scan Circuits
We investigate a new fault ordering heuristic for test generation in full-scan circuits. The heuristic is referred to as the accidental detection index. It associates a value ADI ...
Irith Pomeranz, Sudhakar M. Reddy
CVPR
2010
IEEE
15 years 10 months ago
Detecting and Parsing Architecture at City Scale from Range Data
We present a method for detecting and parsing buildings from unorganized 3D point clouds into a compact, hierarchical representation that is useful for high-level tasks. The input...
Alexander Toshev, Philippos Mordohai, Ben Taskar
CMSB
2010
Springer
14 years 9 months ago
Action-based analysis of discrete regulatory networks with short-term stimuli
To incorporate instant effects and different timescales within a single biological system, an extension of discrete regulatory networks with short-term stimuli is proposed. By mai...
Christian Krause, Carola Krause, Erik P. de Vink
PPOPP
2011
ACM
14 years 5 months ago
Compact data structure and scalable algorithms for the sparse grid technique
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
Alin Florindor Murarasu, Josef Weidendorfer, Gerri...