4114 search results - page 278 / 823 » Efficient Algorithms for the 2-Center Problems |
181
click to vote
APWEB
2005
Springer
16 years 5 days ago
2005
Springer
The dramatic growth in the number and size of on-line information sources has fueled increasing research interest in the incremental subspace learning problem. In this paper, we pr...
166
click to vote
TCS
2008
15 years 6 months ago
2008
Abstract. Many graph problems seem to require knowledge that extends beyond the immediate neighbors of a node. The usual self-stabilizing model only allows for nodes to make decisi...
153
click to vote
ICML
2000
IEEE
16 years 7 months ago
2000
IEEE
We explore combining reinforcement learning with a hand-crafted local controller in a manner suggested by the chaotic control algorithm of Vincent, Schmitt and Vincent (1994). A c...
184
click to vote
NIPS
2008
15 years 8 months ago
2008
It has been shown that the problem of 1-penalized least-square regression commonly referred to as the Lasso or Basis Pursuit DeNoising leads to solutions that are sparse and there...
170
click to vote
COLT
1995
Springer
15 years 10 months ago
1995
Springer
In this paper, we study PAC-leaming algorithms for specialized classes of deterministic finite automata (DFA). Inpartictdar, we study branchingprogrsms, and we investigate the int...