Sciweavers

2698 search results - page 198 / 540
» Approximation Algorithms for the Weighted Independent Set Pr...
Sort
View
ISAAC
2005
Springer
100views Algorithms» more  ISAAC 2005»
16 years 16 hour ago
Separability with Outliers
We develop exact and approximate algorithms for computing optimal separators and measuring the extent to which two point sets in d-dimensional space are separated, with respect to...
Sariel Har-Peled, Vladlen Koltun
ISAAC
2010
Springer
226views Algorithms» more  ISAAC 2010»
15 years 4 months ago
On Tractable Cases of Target Set Selection
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
André Nichterlein, Rolf Niedermeier, Johann...
ICASSP
2009
IEEE
16 years 1 months ago
Robust-SL0 for stable sparse representation in noisy settings
In the last few years, we have witnessed an explosion in applications of sparse representation, the majority of which share the need for finding sparse solutions of underdetermine...
Armin Eftekhari, Massoud Babaie-Zadeh, Christian J...
ICML
2001
IEEE
16 years 7 months ago
Off-Policy Temporal Difference Learning with Function Approximation
We introduce the first algorithm for off-policy temporal-difference learning that is stable with linear function approximation. Off-policy learning is of interest because it forms...
Doina Precup, Richard S. Sutton, Sanjoy Dasgupta
JCP
2008
121views more  JCP 2008»
15 years 6 months ago
Relation Organization of SOM Initial Map by Improved Node Exchange
The Self Organizing Map (SOM) involves neural networks, that learns the features of input data thorough unsupervised, competitive neighborhood learning. In the SOM learning algorit...
Tsutomu Miyoshi