Sciweavers

416 search results - page 53 / 84
» Processing Textbook-Style Matrices
Sort
View
NIPS
2007
13 years 11 months ago
What makes some POMDP problems easy to approximate?
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
David Hsu, Wee Sun Lee, Nan Rong
AVI
2008
13 years 11 months ago
Visualizing program similarity in the Ac plagiarism detection system
Programming assignments are easy to plagiarize in such a way as to foil casual reading by graders. Graders can resort to automatic plagiarism detection systems, which can generate...
Manuel Freire
CDC
2008
IEEE
145views Control Systems» more  CDC 2008»
13 years 10 months ago
Necessary and sufficient conditions for success of the nuclear norm heuristic for rank minimization
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This c...
Benjamin Recht, Weiyu Xu, Babak Hassibi
AUTOMATICA
2008
167views more  AUTOMATICA 2008»
13 years 10 months ago
Stability and robustness analysis of nonlinear systems via contraction metrics and SOS programming
A wide variety of stability and performance questions about linear dynamical systems can be reformulated as convex optimization problems involving linear matrix inequalities (LMIs...
Erin M. Aylward, Pablo A. Parrilo, Jean-Jacques E....
CVIU
2008
179views more  CVIU 2008»
13 years 10 months ago
Incremental, scalable tracking of objects inter camera
This paper presents a scalable solution to the problem of tracking objects across spatially separated, uncalibrated cameras with non overlapping fields of view. The approach relie...
Andrew Gilbert, Richard Bowden