Sciweavers

2297 search results - page 30 / 460
» A fast APRIORI implementation
Sort
View
ICCV
2003
IEEE
15 years 3 months ago
Unsupervised Non-parametric Region Segmentation Using Level Sets
We present a novel non-parametric unsupervised segmentation algorithm based on Region Competition [21]; but implemented within a Level Sets framework [11]. The key novelty of the ...
Timor Kadir, Michael Brady
AUIC
2004
IEEE
15 years 2 months ago
Rapid Visual Flow: How Fast Is Too Fast?
It is becoming increasingly common for user interfaces to use zooming visual effects that automatically adapt to user actions. The MacOs X `dock' icon panel, for instance, us...
Andrew Wallace, Joshua Savage, Andy Cockburn
SSDBM
2006
IEEE
153views Database» more  SSDBM 2006»
15 years 4 months ago
HDF5-FastQuery: Accelerating Complex Queries on HDF Datasets using Fast Bitmap Indices
Large scale scientific data is often stored in scientific data formats such as FITS, netCDF and HDF. These storage formats are of particular interest to the scientific user com...
Luke J. Gosink, John Shalf, Kurt Stockinger, Keshe...
COMPGEOM
2000
ACM
15 years 2 months ago
Fast software for box intersections
We present fast implementations of a hybrid algorithm for reporting box and cube intersections. Our algorithm initially takes a divide-and-conquer approach and switches to simpler...
Afra Zomorodian, Herbert Edelsbrunner
TALG
2008
100views more  TALG 2008»
14 years 10 months ago
Thin heaps, thick heaps
The Fibonacci heap was devised to provide an especially efficient implementation of Dijkstra's shortest path algorithm. Although asyptotically efficient, it is not as fast in...
Haim Kaplan, Robert Endre Tarjan