Sciweavers

2654 search results - page 166 / 531
» On Pairing Inversion Problems
Sort
View
ECCV
2002
Springer
16 years 8 months ago
A New Image Registration Technique with Free Boundary Constraints: Application to Mammography
In this paper, a new image-matching mathematical model is presented for the mammogram registration. In a variational framework, an energy minimization problem is formulated and a m...
Frédéric J. P. Richard, Laurent D. C...
ACTA
2007
85views more  ACTA 2007»
15 years 6 months ago
The complexity of satisfying constraints on databases of transactions
Abstract Computing frequent itemsets is one of the most prominent problems in data mining. Recently, a new related problem, called FREQSAT, was introduced and studied: given some i...
Toon Calders
NA
2007
62views more  NA 2007»
15 years 5 months ago
Runge-Kutta interpolants for high precision computations
Runge-Kutta (RK) pairs furnish approximations of the solution of an initial value problem at discrete points in the interval of integration. Many techniques for enriching these met...
Ch. Tsitouras
CIAC
2010
Springer
232views Algorithms» more  CIAC 2010»
15 years 9 months ago
Multicut Algorithms via Tree Decompositions
Various forms of multicut problems are of great importance in the area of network design. In general, these problems are intractable. However, several parameters have been identifi...
Reinhard Pichler, Stefan Rümmele, Stefan Woltran
FOCS
2003
IEEE
15 years 11 months ago
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim...