Sciweavers

20 search results - page 4 / 4
» Computing minimum distance between two implicit algebraic su...
Sort
View
ICPR
2006
IEEE
14 years 7 months ago
Reconciling Landmarks and Level Sets
Shape warping is a key problem in statistical shape analysis. This paper proposes a framework for geometric shape warping based on both shape distances and landmarks. Our method i...
Olivier D. Faugeras, Pierre Maurel, Renaud Keriven
SMA
2009
ACM
208views Solid Modeling» more  SMA 2009»
14 years 22 days ago
Accelerating geometric queries using the GPU
We present practical algorithms for accelerating geometric queries on models made of NURBS surfaces using programmable Graphics Processing Units (GPUs). We provide a generalized f...
Adarsh Krishnamurthy, Sara McMains, Kirk Haller
COMGEO
2008
ACM
13 years 6 months ago
Optimal location of transportation devices
We consider algorithms for finding the optimal location of a simple transportation device, that we call a moving walkway, consisting of a pair of points in the plane between which ...
Jean Cardinal, Sébastien Collette, Ferran H...
BMCBI
2006
192views more  BMCBI 2006»
13 years 6 months ago
Analysis of circular genome rearrangement by fusions, fissions and block-interchanges
Background: Analysis of genomes evolving via block-interchange events leads to a combinatorial problem of sorting by block-interchanges, which has been studied recently to evaluat...
Chin Lung Lu, Yen-Lin Huang, Tsui Ching Wang, Hsie...
CORR
2010
Springer
179views Education» more  CORR 2010»
13 years 3 months ago
The DMM bound: multivariate (aggregate) separation bounds
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
Ioannis Z. Emiris, Bernard Mourrain, Elias P. Tsig...