Sciweavers

205 search results - page 18 / 41
» Engineering Planar Separator Algorithms
Sort
View
IV
2010
IEEE
125views Visualization» more  IV 2010»
14 years 8 months ago
INSPIRE: A New Method of Mapping Information Spaces
Information spaces such the WWW are the most challenging type of space that many people navigate during everyday life. Unlike the real world, there are no effective maps of inform...
Roy A. Ruddle
ICSE
2008
IEEE-ACM
15 years 10 months ago
Design patterns: between programming and software design
In computer science curricula the two areas programming and software engineering are usually separated. In programming students learn an object oriented language and then deepen t...
Christoph Denzler, Dominik Gruntz
SMA
2003
ACM
120views Solid Modeling» more  SMA 2003»
15 years 2 months ago
Three-dimensional halfspace constructive solid geometry tree construction from implicit boundary representations
This paper presents a new method to compute constructive solid geometry (CSG) tree representations of an object whose faces consist of planar and non-planar surfaces. The algorith...
Suzanne F. Buchele, Richard H. Crawford
VMCAI
2007
Springer
15 years 3 months ago
Constraint Solving for Interpolation
Interpolation is an important component of recent methods for program verification. It provides a natural and effective means for computing separation between the sets of ‘good...
Andrey Rybalchenko, Viorica Sofronie-Stokkermans
DAC
2002
ACM
15 years 10 months ago
Combining strengths of circuit-based and CNF-based algorithms for a high-performance SAT solver
We propose Satisfiability Checking (SAT) techniques that lead to a consistent performance improvement of up to 3x over state-ofthe-art SAT solvers like Chaff on important problem ...
Malay K. Ganai, Pranav Ashar, Aarti Gupta, Lintao ...