Sciweavers

244 search results - page 34 / 49
» Applications of Regularized Least Squares to Classification ...
Sort
View
IDA
2002
Springer
13 years 8 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
CVPR
2010
IEEE
13 years 12 months ago
Classification and Clustering via Dictionary Learning with Structured Incoherence
A clustering framework within the sparse modeling and dictionary learning setting is introduced in this work. Instead of searching for the set of centroid that best fit the data, ...
Pablo Sprechmann, Ignacio Ramirez, Guillermo Sapir...
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
14 years 2 months ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen
EUROGRAPHICS
2010
Eurographics
14 years 5 months ago
Two-Colored Pixels
In this paper we show how to use two-colored pixels as a generic tool for image processing. We apply twocolored pixels as a basic operator as well as a supporting data structure f...
Darko Pavic and Leif Kobbelt
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
14 years 7 days ago
Evolutionary learning with kernels: a generic solution for large margin problems
In this paper we embed evolutionary computation into statistical learning theory. First, we outline the connection between large margin optimization and statistical learning and s...
Ingo Mierswa