Sciweavers

2969 search results - page 241 / 594
» A space efficient algorithm for group structure computation
Sort
View
ICML
2005
IEEE
16 years 5 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
168
Voted
BMCBI
2008
168views more  BMCBI 2008»
15 years 4 months ago
Predicting protein folding pathways at the mesoscopic level based on native interactions between secondary structure elements
Background: Since experimental determination of protein folding pathways remains difficult, computational techniques are often used to simulate protein folding. Most current techn...
Qingwu Yang, Sing-Hoi Sze
MICCAI
2006
Springer
16 years 5 months ago
Accurate Banded Graph Cut Segmentation of Thin Structures Using Laplacian Pyramids
The Graph Cuts method of interactive segmentation has become very popular in recent years. This method performs at interactive speeds for smaller images/volumes, but an unacceptabl...
Ali Kemal Sinop, Leo Grady
139
Voted
ICSM
2005
IEEE
15 years 9 months ago
Co-Change Visualization
Clustering layouts of software systems combine two important aspects: they reveal groups of related artifacts of the software system, and they produce a visualization of the resul...
Dirk Beyer
SAC
2006
ACM
15 years 10 months ago
Efficient query routing for information retrieval in semantic overlays
A fundamental problem in peer-to-peer networks is how to locate appropriate peers efficiently to answer a specific query request. This paper proposes a model in which semantically...
Hai Jin, Xiaoming Ning, Hanhua Chen, Zuoning Yin