Sciweavers

15416 search results - page 34 / 3084
» Embeddings of Computable Structures
Sort
View
132
Voted
JMLR
2008
148views more  JMLR 2008»
15 years 20 days ago
Linear-Time Computation of Similarity Measures for Sequential Data
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
Konrad Rieck, Pavel Laskov
94
Voted
MICCAI
2003
Springer
16 years 1 months ago
Laser Projection Augmented Reality System for Computer Assisted Surgery
A general-purpose augmented reality apparatus was developed. The system uses rapidly scanned lasers to display information directly onto the patient using the patient as a ``proje...
Neil D. Glossop, Chris Wedlake, John Moore, Terry ...
IPCO
1992
100views Optimization» more  IPCO 1992»
15 years 1 months ago
An Exact Characterization of Greedy Structures
We present exact characterizations of structures on which the greedy algorithm produces optimal solutions. Our characterization, which we call matroid embeddings, complete the par...
Paul Helman, Bernard M. E. Moret, Henry D. Shapiro
96
Voted
ICML
2005
IEEE
16 years 1 months ago
Statistical and computational analysis of locality preserving projection
Recently, several manifold learning algorithms have been proposed, such as ISOMAP (Tenenbaum et al., 2000), Locally Linear Embedding (Roweis & Saul, 2000), Laplacian Eigenmap ...
Xiaofei He, Deng Cai, Wanli Min
105
Voted
GD
2004
Springer
15 years 6 months ago
The Three Dimensional Logic Engine
We consider the following graph embedding question: given a graph G, is it possible to map its vertices to points in 3D such that G is isomorphic to the mutual nearest neighbor gra...
Matthew Kitching, Sue Whitesides