Sciweavers

1641 search results - page 48 / 329
» Termination Analysis with Algorithmic Learning
Sort
View
COLT
2010
Springer
15 years 1 months ago
Principal Component Analysis with Contaminated Data: The High Dimensional Case
We consider the dimensionality-reduction problem (finding a subspace approximation of observed data) for contaminated data in the high dimensional regime, where the number of obse...
Huan Xu, Constantine Caramanis, Shie Mannor
122
Voted
ICLP
1997
Springer
15 years 7 months ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...
IJFCS
2008
158views more  IJFCS 2008»
15 years 3 months ago
An Alternative Construction in Symbolic Reachability Analysis of Second Order Pushdown Systems
Abstract. Recently, it has been shown that for any higher order pushdown system H and for any regular set C of configurations, the set pre H(C), is regular. In this paper, we give ...
Anil Seth
145
Voted
ICML
2010
IEEE
15 years 1 months ago
Implicit Online Learning
Online learning algorithms have recently risen to prominence due to their strong theoretical guarantees and an increasing number of practical applications for large-scale data ana...
Brian Kulis, Peter L. Bartlett
KES
2005
Springer
15 years 9 months ago
Learning Within the BDI Framework: An Empirical Analysis
One of the limitations of the BDI (Belief-Desire-Intention) model is the lack of any explicit mechanisms within the architecture to be able to learn. In particular, BDI agents do n...
Toan Phung, Michael Winikoff, Lin Padgham