1538 search results - page 265 / 308 » Spectral Techniques in Graph Algorithms |
SC
1991
ACM
14 years 1 months ago
1991
ACM
Kanada, Y., A method of vector processing for shared symbolic data, Parallel Computing, X (1993) XXX-XXX. Conventional processing techniques for pipelined vector processors such a...
SODA
2000
ACM
13 years 11 months ago
2000
ACM
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
CIKM
2010
Springer
13 years 8 months ago
2010
Springer
In Latent Semantic Indexing (LSI), a collection of documents is often pre-processed to form a sparse term-document matrix, followed by a computation of a low-rank approximation to...
SMI
2010
IEEE
13 years 8 months ago
2010
IEEE
—This paper presents a new technique for detecting sharp features on point-sampled geometry. Sharp features of different nature and possessing angles varying from obtuse to acute...
WWW
2008
ACM
14 years 10 months ago
2008
ACM
This paper shares our experience in designing a web crawler that can download billions of pages using a single-server implementation and models its performance. We show that with ...