Sciweavers

151 search results - page 3 / 31
» Computable Shell Decomposition Bounds
Sort
View
IPL
2002
118views more  IPL 2002»
13 years 5 months ago
Lower bounds for approximate polygon decomposition and minimum gap
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
Joachim Gudmundsson, Thore Husfeldt, Christos Levc...
DAC
1995
ACM
13 years 9 months ago
A Method for Finding Good Ashenhurst Decompositions and Its Application to FPGA Synthesis
—In this paper, we present an algorithm for finding a good Ashenhurst decomposition of a switching function. Most current methods for performing this type of decomposition are ba...
Ted Stanion, Carl Sechen
ECCV
2004
Springer
14 years 8 months ago
Parallel Variational Motion Estimation by Domain Decomposition and Cluster Computing
We present an approach to parallel variational optical flow computation on standard hardware by domain decomposition. Using an arbitrary partition of the image plane into rectangul...
Timo Kohlberger, Christoph Schnörr, Andr&eacu...
WG
2005
Springer
13 years 11 months ago
Algebraic Operations on PQ Trees and Modular Decomposition Trees
Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ...
Ross M. McConnell, Fabien de Montgolfier
STACS
2009
Springer
14 years 1 months ago
A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints
We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of...
Kenya Ueno