Sciweavers

16404 search results - page 805 / 3281
» A set coverage problem
Sort
View
ICIP
2007
IEEE
16 years 9 months ago
Fundamental Matrix Estimation Without Prior Match
This paper presents a probabilistic framework for computing correspondences and fundamental matrix in the structure from motion problem. Inspired by Moisan and Stival [1], we sugg...
Frédéric Sur, Marie-Odile Berger, Ni...
MICCAI
2005
Springer
16 years 8 months ago
Simultaneous Registration and Segmentation of Anatomical Structures from Brain MRI
In this paper, we present a novel variational formulation of the registration assisted image segmentation problem which leads to solving a coupled set of nonlinear PDEs that are so...
Fei Wang, Baba C. Vemuri
VLSID
2003
IEEE
126views VLSI» more  VLSID 2003»
16 years 8 months ago
Comparison of Heuristic Algorithms for Variable Partitioning in Circuit Implementation
Functional decomposition is a process of splitting a complex circuit into smaller sub-circuits. This paper deals with the problem of determining the set of best free and bound var...
Muthukumar Venkatesan, Henry Selvaraj
STOC
2007
ACM
181views Algorithms» more  STOC 2007»
16 years 7 months ago
How to rank with few errors
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
Claire Kenyon-Mathieu, Warren Schudy
APPROX
2009
Springer
118views Algorithms» more  APPROX 2009»
16 years 2 months ago
Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND
The AND problem on t bits is a promise decision problem where either at most one bit of the input is set to 1 (NO instance) or all t bits are set to 1 (YES instance). In this note...
T. S. Jayram