Sciweavers

4302 search results - page 183 / 861
» Index Pairs Algorithms
Sort
View
COMPGEOM
2006
ACM
14 years 4 months ago
Vines and vineyards by updating persistence in linear time
Persistent homology is the mathematical core of recent work on shape, including reconstruction, recognition, and matching. Its pertinent information is encapsulated by a pairing o...
David Cohen-Steiner, Herbert Edelsbrunner, Dmitriy...
IJON
2008
158views more  IJON 2008»
13 years 10 months ago
An adaptive stereo basis method for convolutive blind audio source separation
We consider the problem of convolutive blind source separation of stereo mixtures. This is often tackled using frequency-domain independent component analysis (FDICA), or time-fre...
Maria G. Jafari, Emmanuel Vincent, Samer A. Abdall...
ECCV
2006
Springer
15 years 19 days ago
Describing and Matching 2D Shapes by Their Points of Mutual Symmetry
A novel shape descriptor is introduced. It groups pairs of points that share a geometrical property that is based on their mutual symmetry. The descriptor is visualized as a diagon...
Arjan Kuijper, Ole Fogh Olsen
DNA
2004
Springer
126views Bioinformatics» more  DNA 2004»
14 years 4 months ago
DNA Extraction by XPCR
The extraction of DNA strands including a given sequence of bases is a crucial step in the Adleman-Lipton extract model of DNA computing. In this paper, a special type of PCR is pr...
Giuditta Franco, Cinzia Giagulli, Carlo Laudanna, ...
ICRA
1994
IEEE
98views Robotics» more  ICRA 1994»
14 years 2 months ago
Efficient Distance Computation Between Non-Convex Objects
This paper describes an efficient algorithm for computing the distance between non-convex objects. Objects are modeled as the union of a set of convex components. From this model ...
Sean Quinlan