Sciweavers

4124 search results - page 432 / 825
» Improved Algorithms for Data Migration
Sort
View
CORR
2007
Springer
90views Education» more  CORR 2007»
15 years 6 months ago
Discrete Denoising with Shifts
We introduce S-DUDE, a new algorithm for denoising Discrete Memoryless Channel (DMC)-corrupted data. The algorithm, which generalizes the recently introduced DUDE (Discrete Univer...
Taesup Moon, Tsachy Weissman
IDA
2002
Springer
15 years 6 months ago
Classification with sparse grids using simplicial basis functions
Recently we presented a new approach [20] to the classification problem arising in data mining. It is based on the regularization network approach but in contrast to other methods...
Jochen Garcke, Michael Griebel
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
15 years 10 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
VISUALIZATION
2000
IEEE
15 years 11 months ago
Isosurfacing in higher dimensions
Visualization algorithms have seen substantial improvements in the past several years. However, very few algorithms have been developed for directly studying data in dimensions hi...
Praveen Bhaniramka, Rephael Wenger, Roger Crawfis
TVCG
2010
165views more  TVCG 2010»
15 years 1 months ago
Binary Mesh Partitioning for Cache-Efficient Visualization
Abstract--One important bottleneck when visualizing large data sets is the data transfer between processor and memory. Cacheaware (CA) and cache-oblivious (CO) algorithms take into...
Marc Tchiboukdjian, Vincent Danjean, Bruno Raffin