Sciweavers

2080 search results - page 314 / 416
» Measuring empirical computational complexity
Sort
View
IV
2009
IEEE
107views Visualization» more  IV 2009»
16 years 29 days ago
Multiscale Visual Analysis of Lexical Networks
A lexical network is a very useful resource for natural language processing systems. However, building high quality lexical networks is a complex task. “Jeux de mots” is a web...
Guillaume Artignan, Mountaz Hascoët, Mathieu ...
IPPS
2007
IEEE
16 years 18 days ago
Experimental Evaluation of Emerging Multi-core Architectures
The trend of increasing speed and complexity in the single-core processor as stated in the Moore’s law is facing practical challenges. As a result, the multi-core processor arch...
Abdullah Kayi, Yiyi Yao, Tarek A. El-Ghazawi, Greg...
WAW
2007
Springer
144views Algorithms» more  WAW 2007»
16 years 13 days 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...
AFRIGRAPH
2004
ACM
15 years 11 months ago
Direct HDR capture of the sun and sky
We present a technique for capturing the extreme dynamic range of natural illumination environments that include the sun and sky, which has presented a challenge for traditional h...
Jessi Stumpfel, Chris Tchou, Andrew Jones, Tim Haw...
EUROCRYPT
2004
Springer
15 years 11 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