Sciweavers

17760 search results - page 142 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
ICCAD
1997
IEEE
117views Hardware» more  ICCAD 1997»
15 years 8 months ago
Generalized matching from theory to application
This paper presents a novel approach for post-mapping optimization. We exploit the concept of generalized matching, a technique that nds symbolically all possible matching assignm...
Patrick Vuillod, Luca Benini, Giovanni De Micheli
COMPGEOM
2001
ACM
15 years 7 months ago
Segment intersection searching problems in general settings
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
Vladlen Koltun
CVPR
2009
IEEE
15 years 7 months ago
Fourier analysis and Gabor filtering for texture analysis and local reconstruction of general shapes
Since the pioneering work of Gibson in 1950, ShapeFrom-Texture has been considered by researchers as a hard problem, mainly due to restrictive assumptions which often limit its ap...
Fabio Galasso, Joan Lasenby
AAAI
2007
15 years 6 months ago
Counting CSP Solutions Using Generalized XOR Constraints
We present a general framework for determining the number of solutions of constraint satisfaction problems (CSPs) with a high precision. Our first strategy uses additional binary...
Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabha...
IPCO
2007
98views Optimization» more  IPCO 2007»
15 years 5 months ago
On a Generalization of the Master Cyclic Group Polyhedron
We study the Master Equality Polyhedron (MEP) which generalizes the Master Cyclic Group Polyhedron and the Master Knapsack Polyhedron. We present an explicit characterization of t...
Sanjeeb Dash, Ricardo Fukasawa, Oktay Günl&uu...