Sciweavers

5169 search results - page 531 / 1034
» Locality approximation using time
Sort
View
ICA
2004
Springer
16 years 26 days ago
Postnonlinear Overcomplete Blind Source Separation Using Sparse Sources
Abstract. We present an approach for blindly decomposing an observed random vector x into f(As) where f is a diagonal function i.e. f = f1 × . . . × fm with one-dimensional funct...
Fabian J. Theis, Shun-ichi Amari
VLDB
2001
ACM
129views Database» more  VLDB 2001»
15 years 12 months ago
Similarity Search for Adaptive Ellipsoid Queries Using Spatial Transformation
Similarity retrieval mechanisms should utilize generalized quadratic form distance functions as well as the Euclidean distance function since ellipsoid queries parameters may vary...
Yasushi Sakurai, Masatoshi Yoshikawa, Ryoji Kataok...
COMPGEOM
2010
ACM
15 years 11 months ago
Manifold reconstruction using tangential Delaunay complexes
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
Jean-Daniel Boissonnat, Arijit Ghosh
214
Voted
BMCBI
2007
134views more  BMCBI 2007»
15 years 7 months ago
Efficient pairwise RNA structure prediction using probabilistic alignment constraints in Dynalign
Background: Joint alignment and secondary structure prediction of two RNA sequences can significantly improve the accuracy of the structural predictions. Methods addressing this p...
Arif Ozgun Harmanci, Gaurav Sharma, David H. Mathe...
SIGMETRICS
2002
ACM
104views Hardware» more  SIGMETRICS 2002»
15 years 7 months ago
Improving cluster availability using workstation validation
We demonstrate a framework for improving the availability of cluster based Internet services. Our approach models Internet services as a collection of interconnected components, e...
Taliver Heath, Richard P. Martin, Thu D. Nguyen