1731 search results - page 216 / 347 » Maximum likelihood analysis of algorithms and data structure... |
KDD
2010
ACM
13 years 12 months ago
2010
ACM
Compressing social networks can substantially facilitate mining and advanced analysis of large social networks. Preferably, social networks should be compressed in a way that they...
WWW
2009
ACM
14 years 8 months ago
2009
ACM
This paper identifies and explores the problem of seed selection in a web-scale crawler. We argue that seed selection is not a trivial but very important problem. Selecting proper...
WEA
2009
Springer
14 years 17 days ago
2009
Springer
Flash memory-based solid-state disks are fast becoming the dominant form of end-user storage devices, partly even replacing the traditional hard-disks. Existing two-level memory hi...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
Recently, several manifold learning algorithms have been proposed, such as ISOMAP (Tenenbaum et al., 2000), Locally Linear Embedding (Roweis & Saul, 2000), Laplacian Eigenmap ...
APN
1999
Springer
14 years 9 days ago
1999
Springer
Abstract. This paper presents parallel approaches to the complete transient numerical analysis of stochastic reward nets (SRNs) for both shared and distributed-memory machines. Par...