Sciweavers

1717 search results - page 301 / 344
» A Computable Spectral Theorem
Sort
View
113
Voted
JMIV
2008
106views more  JMIV 2008»
15 years 13 days ago
Estimation of Vector Fields in Unconstrained and Inequality Constrained Variational Problems for Segmentation and Registration
Vector fields arise in many problems of computer vision, particularly in non-rigid registration. In this paper, we develop coupled partial differential equations (PDEs) to estimat...
Gozde B. Unal, Greg G. Slabaugh
114
Voted
JCC
2006
69views more  JCC 2006»
15 years 13 days ago
Dramatic performance enhancements for the FASTER optimization algorithm
: FASTER is a combinatorial optimization algorithm useful for finding low-energy side-chain configurations in side-chain placement and protein design calculations. We present two s...
Benjamin D. Allen, Stephen L. Mayo
95
Voted
DM
2007
100views more  DM 2007»
15 years 13 days ago
Hamiltonian paths with prescribed edges in hypercubes
Given a set P of at most 2n − 4 prescribed edges (n ≥ 5) and vertices u and v whose mutual distance is odd, the n-dimensional hypercube Qn contains a hamiltonian path between ...
Tomás Dvorák, Petr Gregor
86
Voted
MP
2008
135views more  MP 2008»
15 years 13 days ago
A path to the Arrow-Debreu competitive market equilibrium
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
Yinyu Ye
118
Voted
IEICET
2007
110views more  IEICET 2007»
15 years 12 days ago
A Higher-Order Knuth-Bendix Procedure and Its Applications
The completeness (i.e. confluent and terminating) property is an important concept when using a term rewriting system (TRS) as a computational model of functional programming lang...
Keiichirou Kusakari, Yuki Chiba