Sciweavers

308 search results - page 23 / 62
» How Fast Is the k-Means Method
Sort
View
153
Voted
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
16 years 4 months ago
A fast algorithm for finding frequent episodes in event streams
Frequent episode discovery is a popular framework for mining data available as a long sequence of events. An episode is essentially a short ordered sequence of event types and the...
Srivatsan Laxman, P. S. Sastry, K. P. Unnikrishnan
DCC
2004
IEEE
16 years 3 months ago
Coding for Fast Access to Image Regions Defined by Pixel Range
Many technical imaging applications, like coding "images" of digital elevation maps, require extracting regions of compressed images in which the pixel values are within...
Amir Said, Sehoon Yea, William A. Pearlman
131
Voted
3DPVT
2006
IEEE
199views Visualization» more  3DPVT 2006»
15 years 9 months ago
Fast Level Set Multi-View Stereo on Graphics Hardware
In this paper, we show the importance and feasibility of much faster multi-view stereo reconstruction algorithms relying almost exclusively on graphics hardware. Reconstruction al...
Patrick Labatut, Renaud Keriven, Jean-Philippe Pon...
167
Voted
CASES
2006
ACM
15 years 9 months ago
Automatic performance model construction for the fast software exploration of new hardware designs
Developing an optimizing compiler for a newly proposed architecture is extremely difficult when there is only a simulator of the machine available. Designing such a compiler requ...
John Cavazos, Christophe Dubach, Felix V. Agakov, ...
130
Voted
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