Sciweavers

680 search results - page 72 / 136
» Computational Complexity and Anytime Algorithm for Inconsist...
Sort
View
143
Voted
WAW
2007
Springer
144views Algorithms» more  WAW 2007»
15 years 9 months ago
Approximating Betweenness Centrality
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
David A. Bader, Shiva Kintali, Kamesh Madduri, Mil...
109
Voted
EUROCRYPT
2004
Springer
15 years 9 months ago
Merkle Tree Traversal in Log Space and Time
Abstract. We present a technique for Merkle tree traversal which requires only logarithmic space and time1 . For a tree with N nodes, our algorithm computes sequential tree leaves ...
Michael Szydlo
134
Voted
HVEI
2010
15 years 5 months ago
Efficient motion weighted spatio-temporal video SSIM index
Recently, Seshadrinathan and Bovik proposed the Motion-based Video Integrity Evaluation (MOVIE) index for VQA.1,2 MOVIE utilized a multi-scale spatio-temporal Gabor filter bank to...
Anush K. Moorthy, Alan C. Bovik
126
Voted
BMCBI
2008
145views more  BMCBI 2008»
15 years 3 months ago
The contrasting properties of conservation and correlated phylogeny in protein functional residue prediction
Background: Amino acids responsible for structure, core function or specificity may be inferred from multiple protein sequence alignments where a limited set of residue types are ...
Jonathan R. Manning, Emily R. Jefferson, Geoffrey ...
DCC
2006
IEEE
16 years 3 months ago
Compression and Machine Learning: A New Perspective on Feature Space Vectors
The use of compression algorithms in machine learning tasks such as clustering and classification has appeared in a variety of fields, sometimes with the promise of reducing probl...
D. Sculley, Carla E. Brodley