Sciweavers

226 search results - page 27 / 46
» How to learn a graph from smooth signals
Sort
View
78
Voted
ECML
2006
Springer
15 years 1 months ago
Approximate Policy Iteration for Closed-Loop Learning of Visual Tasks
Abstract. Approximate Policy Iteration (API) is a reinforcement learning paradigm that is able to solve high-dimensional, continuous control problems. We propose to exploit API for...
Sébastien Jodogne, Cyril Briquet, Justus H....
ICRA
2007
IEEE
148views Robotics» more  ICRA 2007»
15 years 3 months ago
Seamless Execution of Action Sequences
— One of the most notable and recognizable features of robot motion is the abrupt transitions between actions in action sequences. In contrast, humans and animals perform sequenc...
Freek Stulp, Wolfram Koska, Alexis Maldonado, Mich...
TIP
2010
154views more  TIP 2010»
14 years 8 months ago
Projective Nonnegative Graph Embedding
—We present in this paper a general formulation for nonnegative data factorization, called projective nonnegative graph embedding (PNGE), which 1) explicitly decomposes the data ...
Xiaobai Liu, Shuicheng Yan, Hai Jin
CVPR
2010
IEEE
15 years 5 months ago
Object-Graphs for Context-Aware Category Discovery
How can knowing about some categories help us to discover new ones in unlabeled images? Unsupervised visual category discovery is useful to mine for recurring objects without huma...
Yong Jae Lee, Kristen Grauman
ICDE
2008
IEEE
168views Database» more  ICDE 2008»
15 years 4 months ago
Index Design for Dynamic Personalized PageRank
Personalized PageRank, related to random walks with restarts and conductance in resistive networks, is a frequent search paradigm for graph-structured databases. While efficient ba...
Amit Pathak, Soumen Chakrabarti, Manish S. Gupta