Sciweavers

SAT
2010
Springer
160views Hardware» more  SAT 2010»
13 years 8 months ago
Reconstructing Solutions after Blocked Clause Elimination
Abstract. Preprocessing has proven important in enabling efficient Boolean satisfiability (SAT) solving. For many real application scenarios of SAT it is important to be able to ...
Matti Järvisalo, Armin Biere
DAC
2010
ACM
13 years 8 months ago
An AIG-Based QBF-solver using SAT for preprocessing
In this paper we present a solver for Quantified Boolean Formulas (QBFs) which is based on And-Inverter Graphs (AIGs). We use a new quantifier elimination method for AIGs, which...
Florian Pigorsch, Christoph Scholl
IPPS
1999
IEEE
13 years 8 months ago
A Novel Compilation Framework for Supporting Semi-Regular Distributions in Hybrid Applications
This paper explains how efficient support for semiregular distributions can be incorporated in a uniform compilation framework for hybrid applications. The key focus of this work ...
Dhruva R. Chakrabarti, Prithviraj Banerjee
SIGGRAPH
1999
ACM
13 years 8 months ago
Automatic Image Placement to Provide a Guaranteed Frame Rate
We present a preprocessing algorithm and run-time system for rendering 3D geometric models at a guaranteed frame rate. Our approach trades off space for frame rate by using images...
Daniel G. Aliaga, Anselmo Lastra
DAWAK
2000
Springer
13 years 9 months ago
Enhancing Preprocessing in Data-Intensive Domains using Online-Analytical Processing
Abstract The application of data mining algorithms needs a goal-oriented preprocessing of the data. In practical applications the preprocessing task is very time consuming and has ...
Alexander Maedche, Andreas Hotho, Markus Wiese
IWANN
2001
Springer
13 years 9 months ago
Using Contextual Information to Selectively Adjust Preprocessing Parameters
Abstract. It is generally accepted that some of the problems and ambiguities at the low level of processing can not be resolved without taking into account contextual expectations....
Predrag Neskovic, Leon N. Cooper
DATE
2010
IEEE
126views Hardware» more  DATE 2010»
13 years 9 months ago
Leveraging dominators for preprocessing QBF
— Many CAD for VLSI problems can be naturally encoded as Quantified Boolean Formulas (QBFs) and solved with QBF solvers. Furthermore, such problems often contain circuitbased in...
Hratch Mangassarian, Bao Le, Alexandra Goultiaeva,...
ISAAC
2003
Springer
93views Algorithms» more  ISAAC 2003»
13 years 9 months ago
Range Mode and Range Median Queries on Lists and Trees
We consider algorithms for preprocessing labelled lists and trees so that, for any two nodes u and v we can answer queries of the form: What is the mode or median label in the sequ...
Danny Krizanc, Pat Morin, Michiel H. M. Smid
ATAL
2005
Springer
13 years 10 months ago
Preprocessing techniques for accelerating the DCOP algorithm ADOPT
Methods for solving Distributed Constraint Optimization Problems (DCOP) have emerged as key techniques for distributed reasoning. Yet, their application faces significant hurdles...
Syed Muhammad Ali, Sven Koenig, Milind Tambe
IROS
2006
IEEE
148views Robotics» more  IROS 2006»
13 years 10 months ago
Environment Understanding: Robust Feature Extraction from Range Sensor Data
— This paper proposes an approach allowing indoor environment supervised learning to recognize relevant features for environment understanding. Stochastic preprocessing methods i...
Antonio Romeo, Luis Montano