6740 search results - page 1048 / 1348 » An s -Hamiltonian Line Graph Problem |
208
click to vote
NIPS
2004
15 years 8 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
179
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
We present a theoretical analysis of supervised ranking, providing necessary and sufficient conditions for the asymptotic consistency of algorithms based on minimizing a surrogate...
228
click to vote
SOFTVIS
2010
ACM
15 years 7 months ago
2010
ACM
Understanding the data structures in a program is crucial to understanding how the program works, or why it doesn't work. Inspecting the code that implements the data structu...
170
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: Visualising the evolutionary history of a set of sequences is a challenge for molecular phylogenetics. One approach is to use undirected graphs, such as median network...
204
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...