Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
2
search results - page 1 / 1
»
A Fast Algorithm to Calculate Powers of a Boolean Matrix for...
Sort
relevance
views
votes
recent
update
View
thumb
title
9
click to vote
WALCOM
2008
IEEE
127
views
Algorithms
»
more
WALCOM 2008
»
A Fast Algorithm to Calculate Powers of a Boolean Matrix for Diameter Computation of Random Graphs
13 years 6 months ago
Download
networking.khu.ac.kr
In this paper, a fast algorithm is proposed to calculate kth power of an n
Md. Abdur Razzaque, Choong Seon Hong, Mohammad Abd...
claim paper
Read More »
16
click to vote
NIPS
2004
215
views
Information Technology
»
more
NIPS 2004
»
Hierarchical Eigensolver for Transition Matrices in Spectral Methods
13 years 6 months ago
Download
books.nips.cc
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...
Chakra Chennubhotla, Allan D. Jepson
claim paper
Read More »
« Prev
« First
page 1 / 1
Last »
Next »