Sciweavers

178 search results - page 32 / 36
» Computing Longest Previous Factor in linear time and applica...
Sort
View
SIGMOD
2007
ACM
169views Database» more  SIGMOD 2007»
14 years 7 months ago
Genome-scale disk-based suffix tree indexing
With the exponential growth of biological sequence databases, it has become critical to develop effective techniques for storing, querying, and analyzing these massive data. Suffi...
Benjarath Phoophakdee, Mohammed J. Zaki
RECSYS
2009
ACM
14 years 1 months ago
Learning to recommend with trust and distrust relationships
With the exponential growth of Web contents, Recommender System has become indispensable for discovering new information that might interest Web users. Despite their success in th...
Hao Ma, Michael R. Lyu, Irwin King
HPCA
2000
IEEE
13 years 11 months ago
A Prefetching Technique for Irregular Accesses to Linked Data Structures
Prefetching offers the potential to improve the performance of linked data structure (LDS) traversals. However, previously proposed prefetching methods only work well when there i...
Magnus Karlsson, Fredrik Dahlgren, Per Stenstr&oum...
ICDE
2005
IEEE
139views Database» more  ICDE 2005»
14 years 8 months ago
Compressing Bitmap Indices by Data Reorganization
Many scientific applications generate massive volumes of data through observations or computer simulations, bringing up the need for effective indexing methods for efficient stora...
Ali Pinar, Tao Tao, Hakan Ferhatosmanoglu
WWW
2009
ACM
14 years 8 months ago
Bid optimization for broad match ad auctions
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan...