Sciweavers

5210 search results - page 259 / 1042
» Exact geometric computation
Sort
View
IWPEC
2004
Springer
16 years 3 hour ago
Parameterized Graph Separation Problems
We consider parameterized problems where some separation property has to be achieved by deleting as few vertices as possible. The following five problems are studied: delete k ve...
Dániel Marx
ICES
2003
Springer
86views Hardware» more  ICES 2003»
15 years 12 months ago
A Note on Designing Logical Circuits Using SAT
Abstract. We present a systematic procedure for the synthesis and minimisation of digital circuits using propositional satisfiability. We encode the truth table into a canonical s...
Giovani Gomez Estrada
ISPD
1998
ACM
107views Hardware» more  ISPD 1998»
15 years 11 months ago
Sequence-pair based placement method for hard/soft/pre-placed modules
This paper proposes a placement method for a mixed set of hard, soft, and pre-placed modules, based on a placement topology representation called sequence-pair. Under one sequence...
Hiroshi Murata, Ernest S. Kuh
AUSAI
2006
Springer
15 years 10 months ago
Efficient AUC Learning Curve Calculation
Abstract. A learning curve of a performance measure provides a graphical method with many benefits for judging classifier properties. The area under the ROC curve (AUC) is a useful...
Remco R. Bouckaert
DATESO
2004
116views Database» more  DATESO 2004»
15 years 8 months ago
Using Blind Search and Formal Concepts for Binary Factor Analysis
Binary Factor Analysis (BFA, also known as Boolean Factor Analysis) may help with understanding collections of binary data. Since we can take collections of text documents as binar...
Ales Keprt