Sciweavers

2593 search results - page 232 / 519
» Algorithms and Data Structures for Computer Topology
Sort
View
SIGGRAPH
1994
ACM
15 years 11 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
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
16 years 7 months ago
Assessing data mining results via swap randomization
The problem of assessing the significance of data mining results on high-dimensional 0?1 data sets has been studied extensively in the literature. For problems such as mining freq...
Aristides Gionis, Heikki Mannila, Panayiotis Tsapa...
KAIS
2007
75views more  KAIS 2007»
15 years 6 months ago
Non-redundant data clustering
Data clustering is a popular approach for automatically finding classes, concepts, or groups of patterns. In practice this discovery process should avoid redundancies with existi...
David Gondek, Thomas Hofmann
FECS
2006
80views Education» more  FECS 2006»
15 years 8 months ago
A Redesigned Undergraduate Data Communication and Networking Course Incorporating Theory and Practice
Data Communication and Computer Networking is a traditional undergraduate CS course. Classic teaching focuses on communication protocol and algorithm analysis, plus socket programm...
Ziping Liu
IPPS
2010
IEEE
15 years 4 months ago
Optimization of linked list prefix computations on multithreaded GPUs using CUDA
We present a number of optimization techniques to compute prefix sums on linked lists and implement them on multithreaded GPUs using CUDA. Prefix computations on linked structures ...
Zheng Wei, Joseph JáJá