Sciweavers

1066 search results - page 79 / 214
» Computing Private Set Operations with Linear Complexities
Sort
View
IJCNN
2007
IEEE
15 years 4 months ago
Search Strategies Guided by the Evidence for the Selection of Basis Functions in Regression
— This work addresses the problem of selecting a subset of basis functions for a model linear in the parameters for regression tasks. Basis functions from a set of candidates are...
Ignacio Barrio, Enrique Romero, Lluís Belan...
COR
2008
102views more  COR 2008»
14 years 9 months ago
An algorithm for ranking assignments using reoptimization
We consider the problem of ranking assignments according to cost in the classical linear assignment problem. An algorithm partitioning the set of possible assignments, as suggeste...
Christian Roed Pedersen, Lars Relund Nielsen, Kim ...
PRL
2011
14 years 4 months ago
Efficient approximate Regularized Least Squares by Toeplitz matrix
Machine Learning based on the Regularized Least Square (RLS) model requires one to solve a system of linear equations. Direct-solution methods exhibit predictable complexity and s...
Sergio Decherchi, Paolo Gastaldo, Rodolfo Zunino
VLSID
1997
IEEE
109views VLSI» more  VLSID 1997»
15 years 2 months ago
Delay-Insensitive Carry-Lookahead Adders
Integer addition is one of the most important operations in digital computer systems because the performance of processors is significantly influenced by the speed of their adde...
Fu-Chiung Cheng, Stephen H. Unger, Michael Theobal...
CVPR
2005
IEEE
15 years 11 months ago
Subspace Analysis Using Random Mixture Models
In [1], three popular subspace face recognition methods, PCA, Bayes, and LDA were analyzed under the same framework and an unified subspace analysis was proposed. However, since t...
Xiaogang Wang, Xiaoou Tang