Sciweavers

13376 search results - page 468 / 2676
» Problem Solving with
Sort
View
ISCAS
2006
IEEE
70views Hardware» more  ISCAS 2006»
16 years 1 days ago
A systolic array technique for determining common approximate substrings
— A new technique that makes use of a systolic array structure is proposed for solving the common approximate substring (CAS) problem. This approach extends the technique introdu...
Kenneth B. Kent, Jacqueline E. Rice
ICIP
2009
IEEE
16 years 7 months ago
2d-3d Registration Of Deformable Shapes With Manifold Projection
We present an algorithm able to register a known 3D deformable model to a set of 2D matched points extracted from a single image. Unlike previous approaches, the problem is solved...
CORR
2010
Springer
81views Education» more  CORR 2010»
15 years 6 months ago
Using machine learning to make constraint solver implementation decisions
Programs to solve so-called constraint problems are complex pieces of software which require many design decisions to be made more or less arbitrarily by the implementer. These dec...
Lars Kotthoff, Ian P. Gent, Ian Miguel
INFORMS
1998
150views more  INFORMS 1998»
15 years 5 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
IPPS
2010
IEEE
15 years 3 months ago
Large scale complex network analysis using the hybrid combination of a MapReduce cluster and a highly multithreaded system
Complex networks capture interactions among entities in various application areas in a graph representation. Analyzing large scale complex networks often answers important question...
Seunghwa Kang, David A. Bader