Sciweavers

11910 search results - page 253 / 2382
» Online Learning Algorithms
Sort
View
ICRA
2010
IEEE
150views Robotics» more  ICRA 2010»
15 years 5 months ago
Balancing state-space coverage in planning with dynamics
— Sampling-based kinodynamic planners, such as the popular RRT algorithm, have been proposed as promising solutions to planning for systems with dynamics. Nevertheless, complex s...
Yanbo Li, Kostas E. Bekris
ICML
2010
IEEE
15 years 7 months ago
A Fast Augmented Lagrangian Algorithm for Learning Low-Rank Matrices
We propose a general and efficient algorithm for learning low-rank matrices. The proposed algorithm converges super-linearly and can keep the matrix to be learned in a compact fac...
Ryota Tomioka, Taiji Suzuki, Masashi Sugiyama, His...
AAIM
2009
Springer
143views Algorithms» more  AAIM 2009»
15 years 4 months ago
Discrete online TSP
In this paper we introduce a discrete version of the online traveling salesman problem (DOLTSP). We represent the metric space using a weighted graph, where the server is allowed t...
Mauro Aprea, Esteban Feuerstein, Gustavo Sadovoy, ...
IAT
2007
IEEE
16 years 26 days ago
Learn to Detect Phishing Scams Using Learning and Ensemble ?Methods
Phishing attack is a kind of identity theft which tries to steal confidential data like on-line bank account information. In a phishing attack scenario, attacker deceives users by...
Alireza Saberi, Mojtaba Vahidi, Behrouz Minaei-Bid...
ICML
2007
IEEE
16 years 7 months ago
CarpeDiem: an algorithm for the fast evaluation of SSL classifiers
In this paper we present a novel algorithm, CarpeDiem. It significantly improves on the time complexity of Viterbi algorithm, preserving the optimality of the result. This fact ha...
Roberto Esposito, Daniele P. Radicioni