Random Walks and Diffusions on Graphs and Databases
Most networks and databases that humans have to deal with contain large, albeit finite number of units. Their structure, for maintaining functional consistency of the components, is essentially not random and calls for a precise quantitative description of relations between nodes (or data units) and...
שמור ב:
| Những tác giả chính: | , |
|---|---|
| פורמט: | ספר |
| שפה: | English |
| יצא לאור: |
Springer - Verlag
2011
|
| נושאים: | |
| גישה מקוונת: | https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/25946 |
| תגים: |
הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|
| Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
|---|