2740 search results - page 197 / 548 » Approximating Component Selection |
128
Voted
ICCV
2009
IEEE
15 years 1 months ago
2009
IEEE
The use of Mercer kernel methods in statistical learning theory provides for strong learning capabilities, as seen in kernel principal component analysis and support vector machin...
158
click to vote
AUTOMATICA
2011
14 years 10 months ago
2011
An asynchronous stochastic approximation based (Frequentist) approach is proposed for mapping using noisy mobile sensors under two different scenarios: 1) perfectly known sensor ...
114
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
This paper deals with the minimal polyadic decomposition (also known as canonical decomposition or Parafac) of a 3way array, assuming each entry is positive. In this case, the low...
152
click to vote
SODA
2010
ACM
15 years 1 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
214
Voted
ICSE
2004
IEEE-ACM
16 years 3 months ago
2004
IEEE-ACM
Cancelling or reversing the effect of a former action is a necessity in most interactive systems. The simplest and most frequent form of this facility is the "undo" comma...