Sciweavers

14548 search results - page 2803 / 2910
» The Optimal Path-Matching Problem
Sort
View
120
Voted
NIPS
2001
15 years 1 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
SODA
2004
ACM
128views Algorithms» more  SODA 2004»
15 years 1 months ago
Equivalence of local treewidth and linear local treewidth and its algorithmic applications
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...
Erik D. Demaine, Mohammad Taghi Hajiaghayi
ISMB
2000
15 years 1 months ago
Analysis of Gene Expression Microarrays for Phenotype Classification
Several microarray technologies that monitor the level of expression of a large number of genes have recently emerged. Given DNA-microarray data for a set of cells characterized b...
Andrea Califano, Gustavo Stolovitzky, Yuhai Tu
ICGA
1997
122views Optimization» more  ICGA 1997»
15 years 1 months ago
A Comparison of Global and Local Search Methods in Drug Docking
Molecular docking software makes computational predictions of the interaction of molecules. This can be useful, for example, in evaluating the binding of candidate drug molecules ...
Christopher D. Rosin, R. Scott Halliday, William E...
DLOG
1996
15 years 1 months ago
Can Description Logics Be Used in Real-Life Knowledge-Based Systems?
In 1995, I nished my Ph.D. project which was focused on the selection of adequate Knowledge-Representation Systems (KRSs) for research applications. When I started working at the ...
Piet-Hein Speel
« Prev « First page 2803 / 2910 Last » Next »