Sciweavers

1024 search results - page 113 / 205
» The Generalized PatchMatch Correspondence Algorithm
Sort
View
NIPS
2001
14 years 11 months ago
Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...
Mikhail Belkin, Partha Niyogi
MOBICOM
2010
ACM
14 years 10 months ago
Indoor localization without the pain
While WiFi-based indoor localization is attractive, the need for a significant degree of pre-deployment effort is a key challenge. In this paper, we ask the question: can we perfo...
Krishna Chintalapudi, Anand Padmanabha Iyer, Venka...
AI
2010
Springer
14 years 10 months ago
Logic-based ontology comparison and module extraction, with an application to DL-Lite
We develop a formal framework for comparing different versions of ontologies, and apply it to ontologies formulated in terms of DL-Lite, a family of `lightweight' description...
Roman Kontchakov, Frank Wolter, Michael Zakharyasc...
BMCBI
2008
166views more  BMCBI 2008»
14 years 10 months ago
Biclustering via optimal re-ordering of data matrices in systems biology: rigorous methods and comparative studies
Background: The analysis of large-scale data sets via clustering techniques is utilized in a number of applications. Biclustering in particular has emerged as an important problem...
Peter A. DiMaggio Jr., Scott R. McAllister, Christ...
BMCBI
2006
161views more  BMCBI 2006»
14 years 10 months ago
A novel approach to phylogenetic tree construction using stochastic optimization and clustering
Background: The problem of inferring the evolutionary history and constructing the phylogenetic tree with high performance has become one of the major problems in computational bi...
Ling Qin, Yixin Chen, Yi Pan, Ling Chen