Sciweavers

1170 search results - page 67 / 234
» How Fast Is Too Fast
Sort
View
CIKM
2005
Springer
15 years 8 months ago
Opportunity map: a visualization framework for fast identification of actionable knowledge
Data mining techniques frequently find a large number of patterns or rules, which make it very difficult for a human analyst to interpret the results and to find the truly interes...
Kaidi Zhao, Bing Liu, Thomas M. Tirpak, Weimin Xia...
FSE
1997
Springer
131views Cryptology» more  FSE 1997»
15 years 7 months ago
Fast Software Encryption: Designing Encryption Algorithms for Optimal Software Speed on the Intel Pentium Processor
Most encryption algorithms are designed without regard to their performance on top-of-the-line microprocessors. This paper discusses general optimization principles algorithms desi...
Bruce Schneier, Doug Whiting
SIGGRAPH
1994
ACM
15 years 7 months ago
Fast volume rendering using a shear-warp factorization of the viewing transformation
Several existing volume rendering algorithms operate by factoring the viewing transformation into a 3D shear parallel to the data slices, a projection to form an intermediate but ...
Philippe Lacroute, Marc Levoy
154
Voted
CIKM
2008
Springer
15 years 4 months ago
A sparse gaussian processes classification framework for fast tag suggestions
Tagged data is rapidly becoming more available on the World Wide Web. Web sites which populate tagging services offer a good way for Internet users to share their knowledge. An in...
Yang Song, Lu Zhang 0007, C. Lee Giles
BIODATAMINING
2008
96views more  BIODATAMINING 2008»
15 years 3 months ago
Fast approximate hierarchical clustering using similarity heuristics
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
Meelis Kull, Jaak Vilo