Sciweavers

11740 search results - page 295 / 2348
» More Problems in Rewriting
Sort
View
CVPR
2011
IEEE
15 years 2 months ago
A Closed Form Solution to Robust Subspace Estimation and Clustering
We consider the problem of fitting one or more subspaces to a collection of data points drawn from the subspaces and corrupted by noise/outliers. We pose this problem as a rank m...
Paolo Favaro, René, Vidal, Avinash Ravichandran
ICPR
2006
IEEE
16 years 7 months ago
A Maximum-Likelihood Approach to Symbolic Indirect Correlation
Symbolic Indirect Correlation (SIC) is a nonparametric method that offers significant advantages for recognition of ordered unsegmented signals. A previously introduced formulatio...
Ashutosh Joshi, Daniel P. Lopresti, George Nagy, S...
TACAS
2010
Springer
167views Algorithms» more  TACAS 2010»
16 years 1 months ago
Antichain Algorithms for Finite Automata
Abstract. We present a general theory that exploits simulation relations on transition systems to obtain antichain algorithms for solving the reachability and repeated reachability...
Laurent Doyen, Jean-François Raskin
CEC
2007
IEEE
16 years 1 months ago
NEMO: neural enhancement for multiobjective optimization
— In this paper, a neural network approach is presented to expand the Pareto-optimal front for multiobjective optimization problems. The network is trained using results obtained...
Aaron Garrett, Gerry V. Dozier, Kalyanmoy Deb
LPAR
2007
Springer
16 years 23 days ago
Complexity of Planning in Action Formalisms Based on Description Logics
Abstract. In this paper, we continue the recently started work on integrating action formalisms with description logics (DLs), by investigating planning in the context of DLs. We p...
Maja Milicic