Sciweavers

2570 search results - page 227 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
DAGSTUHL
1997
15 years 5 months ago
Simple, Fast, and Robust Ray Casting of Irregular Grids
In this paper we describe a simple and efficient ray casting engine that is suitable for the rapid exploration of irregular grids composed of tetrahedra cells, or other cell comp...
Paul Bunyk, Arie E. Kaufman, Cláudio T. Sil...
EOR
2007
96views more  EOR 2007»
15 years 4 months ago
A fast method for discovering critical edge sequences in e-commerce catalogs
Web sites allow the collection of vast amounts of navigational data – clickstreams of user traversals through the site. These massive data stores offer the tantalizing possibil...
Kaushik Dutta, Debra E. VanderMeer, Anindya Datta,...
VISSYM
2003
15 years 5 months ago
A Robust Level-Set Algorithm for Centerline Extraction
We present a robust method for extracting 3D centerlines from volumetric datasets. We start from a 2D skeletonization method to locate voxels centered with respect to three orthog...
Alexandru Telea, Anna Vilanova
VLDB
2001
ACM
139views Database» more  VLDB 2001»
15 years 8 months ago
NetCube: A Scalable Tool for Fast Data Mining and Compression
We propose an novel method of computing and storing DataCubes. Our idea is to use Bayesian Networks, which can generate approximate counts for any query combination of attribute v...
Dimitris Margaritis, Christos Faloutsos, Sebastian...
CCS
2005
ACM
15 years 9 months ago
Fast dictionary attacks on passwords using time-space tradeoff
Human-memorable passwords are a mainstay of computer security. To decrease vulnerability of passwords to bruteforce dictionary attacks, many organizations enforce complicated pass...
Arvind Narayanan, Vitaly Shmatikov