Sciweavers

25041 search results - page 4326 / 5009
» Algorithms for Clustering Data
Sort
View
ICDM
2002
IEEE
145views Data Mining» more  ICDM 2002»
16 years 6 days ago
Mining Top-K Frequent Closed Patterns without Minimum Support
In this paper, we propose a new mining task: mining top-k frequent closed patterns of length no less than min , where k is the desired number of frequent closed patterns to be min...
Jiawei Han, Jianyong Wang, Ying Lu, Petre Tzvetkov
VISUALIZATION
2002
IEEE
16 years 4 days ago
XFastMesh: Fast View-dependent Meshing from External Memory
We present a novel disk-based multiresolution triangle mesh data structure that supports paging and view-dependent rendering of very large meshes at interactive frame rates from e...
Christopher DeCoro, Renato Pajarola
SIGMOD
2010
ACM
202views Database» more  SIGMOD 2010»
16 years 2 days ago
PAROS: pareto optimal route selection
Modern maps provide a variety of information about roads and their surrounding landscape allowing navigation systems to go beyond simple shortest path computation. In this demo, w...
Franz Graf, Hans-Peter Kriegel, Matthias Renz, Mat...
SIGGRAPH
2000
ACM
15 years 11 months ago
Surfels: surface elements as rendering primitives
Surface elements (surfels) are a powerful paradigm to efficiently render complex geometric objects at interactive frame rates. Unlike classical surface discretizations, i.e., tri...
Hanspeter Pfister, Matthias Zwicker, Jeroen van Ba...
FCCM
1999
IEEE
134views VLSI» more  FCCM 1999»
15 years 11 months ago
Runlength Compression Techniques for FPGA Configurations
The time it takes to reconfigure FPGAs can be a significant overhead for reconfigurable computing. In this paper we develop new compression algorithms for FPGA configurations that...
Scott Hauck, William D. Wilson
« Prev « First page 4326 / 5009 Last » Next »