Sciweavers

459 search results - page 4 / 92
» The scalable hyperlink store
Sort
View
ADL
2000
Springer
265views Digital Library» more  ADL 2000»
15 years 2 months ago
Clustering and Identifying Temporal Trends in Document Databases
We introduce a simple and efficient method for clustering and identifying temporal trends in hyper-linked document databases. Our method can scale to large datasets because it ex...
Alexandrin Popescul, Gary William Flake, Steve Law...
ICCD
2007
IEEE
132views Hardware» more  ICCD 2007»
15 years 7 months ago
A position-insensitive finished store buffer
This paper presents the Finished Store Buffer (or FSB), an alternative and position-insensitive approach for building a scalable store buffer for an out-of-order processor. Exploi...
Erika Gunadi, Mikko H. Lipasti
ICTAI
2000
IEEE
15 years 2 months ago
Reverse mapping of referral links from storage hierarchy for Web documents
In world wide web, a document is usually made up of multiple pages, each one of which has a unique URL address and links to each other by hyperlink pointers. Related documents are...
Chen Ding, Chi-Hung Chi, Vincent Tam
HT
1996
ACM
15 years 2 months ago
HyPursuit: A Hierarchical Network Search Engine that Exploits Content-Link Hypertext Clustering
HyPursuit is a new hierarchical network search engine that clusters hypertext documents to structure a given information space for browsing and search activities. Our content-link...
Ron Weiss, Bienvenido Vélez, Mark A. Sheldo...
IMCSIT
2010
14 years 7 months ago
Assembling Recursively Stored Sparse Matrices
Abstract--Recently, we have introduced an approach to multicore computations on sparse matrices using recursive partitioning, called Recursive Sparse Blocks (RSB). In this document...
Michele Martone, Salvatore Filippone, Marcin Paprz...