Sciweavers

4324 search results - page 811 / 865
» A Generalized Representer Theorem
Sort
View
PLDI
2006
ACM
15 years 6 months ago
Optimizing data permutations for SIMD devices
The widespread presence of SIMD devices in today’s microprocessors has made compiler techniques for these devices tremendously important. One of the most important and difficul...
Gang Ren, Peng Wu, David A. Padua
SAC
2006
ACM
15 years 6 months ago
Evaluation of rule-based modularization in model transformation languages illustrated with ATL
This paper studies ways for modularizing transformation definitions in current rule-based model transformation languages. Two scenarios are shown in which the modular units are id...
Ivan Kurtev, Klaas van den Berg, Fréd&eacut...
SAC
2006
ACM
15 years 6 months ago
The impact of sample reduction on PCA-based feature extraction for supervised learning
“The curse of dimensionality” is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimension...
Mykola Pechenizkiy, Seppo Puuronen, Alexey Tsymbal
SIGCSE
2006
ACM
362views Education» more  SIGCSE 2006»
15 years 6 months ago
Chirp on crickets: teaching compilers using an embedded robot controller
Traditionally, the topics of compiler construction and language processing have been taught as an elective course in Computer Science curricula. As such, students may graduate wit...
Li Xu, Fred G. Martin
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
15 years 6 months ago
The computational complexity of nash equilibria in concisely represented games
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
Grant Schoenebeck, Salil P. Vadhan