34 search results - page 2 / 7 » Betweenness, Metrics and Entropies in Lattices |
DCC
2006
IEEE
14 years 8 months ago
2006
IEEE
Optimal index assignment of multiple description lattice vector quantizer (MDLVQ) can be posed as a large-scale linear assignment problem. But is this expensive algorithmic approa...
ICML
2003
IEEE
14 years 9 months ago
2003
IEEE
In this paper we analyze the most popular evaluation metrics for separate-and-conquer rule learning algorithms. Our results show that all commonly used heuristics, including accur...
DAM
1999
13 years 8 months ago
1999
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
IMC
2007
ACM
13 years 10 months ago
2007
ACM
Entropy has recently gained considerable significance as an important metric for network measurement. Previous research has shown its utility in clustering traffic and detecting ...
MMMACNS
2005
Springer
14 years 2 months ago
2005
Springer
The continuous general linear group in n dimensions can be decomposed into two Lie groups: (1) an n(n-1) dimensional ‘Markov type’ Lie group that is defined by preserving the ...