Sciweavers

756 search results - page 24 / 152
» A new algorithm for Boolean operations on general polygons
Sort
View
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
14 years 9 days ago
SAT based ATPG using fast justification and propagation in the implication graph
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
Paul Tafertshofer, Andreas Ganz
SODA
2010
ACM
157views Algorithms» more  SODA 2010»
14 years 5 months ago
Testing monotone high-dimensional distributions
A monotone distribution P over a (partially) ordered domain assigns higher probability to y than to x if y x in the order. We study several natural problems concerning testing pr...
Ronitt Rubinfeld, Rocco A. Servedio
GECCO
2006
Springer
200views Optimization» more  GECCO 2006»
13 years 11 months ago
A new approach for shortest path routing problem by random key-based GA
In this paper, we propose a Genetic Algorithm (GA) approach using a new paths growth procedure by the random key-based encoding for solving Shortest Path Routing (SPR) problem. An...
Mitsuo Gen, Lin Lin
ICDE
2000
IEEE
183views Database» more  ICDE 2000»
14 years 9 months ago
Accurate Estimation of the Cost of Spatial Selections
Optimizing queries that involve operations on spatial data requires estimating the selectivity and cost of these operations. In this paper, we focus on estimating the cost of spat...
Ashraf Aboulnaga, Jeffrey F. Naughton
SIGGRAPH
1998
ACM
14 years 7 days ago
Progressive Forest Split Compression
In this paper we introduce the Progressive Forest Split (PFS) representation, a new adaptive refinement scheme for storing and transmitting manifold triangular meshes in progress...
Gabriel Taubin, André Guéziec, Willi...