Sciweavers

1458 search results - page 170 / 292
» Practical Preference Relations for Large Data Sets
Sort
View
SIGIR
1992
ACM
15 years 9 months ago
A Faster Algorithm for Constructing Minimal Perfect Hash Functions
Our previous research on one-probe access to large collections of data indexed by alphanumeric keys has produced the first practical minimal perfect hash functions for this proble...
Edward A. Fox, Qi Fan Chen, Lenwood S. Heath
IC
2001
15 years 6 months ago
Adaptive Web Sites by Web Usage Mining
An approach for reorganizing a Web site based on user access patterns is proposed. The Web server's log les and the Web pages on the site are rst preprocessed to obtain the ac...
Yongjian Fu, Mario Creado, Ming-Yi Shih
SODA
2008
ACM
126views Algorithms» more  SODA 2008»
15 years 7 months ago
On distributing symmetric streaming computations
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropo...
BMCBI
2007
179views more  BMCBI 2007»
15 years 5 months ago
Gene selection with multiple ordering criteria
Background: A microarray study may select different differentially expressed gene sets because of different selection criteria. For example, the fold-change and p-value are two co...
James J. Chen, Chen-An Tsai, ShengLi Tzeng, Chun-H...
VISUALIZATION
1996
IEEE
15 years 9 months ago
Illustrating Transparent Surfaces with Curvature-Directed Strokes
Transparency can be a useful device for simultaneously depicting multiple superimposed layers of information in a single image. However, in computer-generated pictures -as in phot...
Victoria Interrante, Henry Fuchs, Stephen M. Pizer