315 search results - page 40 / 63 » Better Approximation of Betweenness Centrality |
BMCBI
2006
13 years 10 months ago
2006
Background: Phylogenetic analysis is emerging as one of the most informative computational methods for the annotation of genes and identification of evolutionary modules of functi...
STOC
2007
ACM
14 years 10 months ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
FOCS
2009
IEEE
14 years 4 months ago
2009
IEEE
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
CRYPTO
2006
Springer
14 years 1 months ago
2006
Springer
Abstract Lattice reduction is a hard problem of interest to both publickey cryptography and cryptanalysis. Despite its importance, extremely few algorithms are known. The best algo...
MOBISYS
2004
ACM
14 years 9 months ago
2004
ACM
Wireless data broadcast has received a lot of attention from industries and academia in recent years. Access efficiency and energy conservation are two critical performance concer...