Sciweavers

4072 search results - page 702 / 815
» Designing an Optimal Network Using the Cross-Entropy Method
Sort
View
CAGD
2005
88views more  CAGD 2005»
14 years 11 months ago
An efficient bit allocation for compressing normal meshes with an error-driven quantization
We propose a new wavelet compression algorithm based on the rate-distortion optimization for densely sampled triangular meshes. Exploiting the normal remesher of Guskov et al., th...
Frédéric Payan, Marc Antonini
CF
2009
ACM
15 years 6 months ago
Mapping the LU decomposition on a many-core architecture: challenges and solutions
Recently, multi-core architectures with alternative memory subsystem designs have emerged. Instead of using hardwaremanaged cache hierarchies, they employ software-managed embedde...
Ioannis E. Venetis, Guang R. Gao
IMC
2006
ACM
15 years 5 months ago
Approximate fingerprinting to accelerate pattern matching
Pattern matching and analysis over network data streams is increasingly becoming an essential primitive of network monitoring systems. It is a fundamental part of most intrusion d...
Ramaswamy Ramaswamy, Lukas Kencl, Gianluca Iannacc...
TNN
1998
114views more  TNN 1998»
14 years 11 months ago
Bayesian retrieval in associative memories with storage errors
Abstract—It is well known that for finite-sized networks, onestep retrieval in the autoassociative Willshaw net is a suboptimal way to extract the information stored in the syna...
Friedrich T. Sommer, Peter Dayan
KDD
2006
ACM
272views Data Mining» more  KDD 2006»
15 years 12 months ago
YALE: rapid prototyping for complex data mining tasks
KDD is a complex and demanding task. While a large number of methods has been established for numerous problems, many challenges remain to be solved. New tasks emerge requiring th...
Ingo Mierswa, Michael Wurst, Ralf Klinkenberg, Mar...