Sciweavers

597 search results - page 79 / 120
» Homomorphisms of random paths
Sort
View
TIP
2010
176views more  TIP 2010»
13 years 4 months ago
A PDE Formalization of Retinex Theory
In 1964 Edwin H. Land formulated the Retinex theory, the first attempt to simulate and explain how the human visual system perceives color. His theory and an extension, the "r...
Jean-Michel Morel, Ana Belen Petro, Catalina Sbert
ICML
2003
IEEE
14 years 10 months ago
Marginalized Kernels Between Labeled Graphs
A new kernel function between two labeled graphs is presented. Feature vectors are defined as the counts of label paths produced by random walks on graphs. The kernel computation ...
Hisashi Kashima, Koji Tsuda, Akihiro Inokuchi
ICCBR
2009
Springer
14 years 4 months ago
S-Learning: A Model-Free, Case-Based Algorithm for Robot Learning and Control
A model-free, case-based learning and control algorithm called S-learning is described as implemented in a simulation of a light-seeking mobile robot. S-learning demonstrated learn...
Brandon Rohrer
WCNC
2008
IEEE
14 years 4 months ago
Distributed Space-Frequency Coding over Amplify-and-Forward Relay Channels
Abstract— In this paper, the design of distributed spacefrequency codes (DSFCs) for wireless relay networks employing the amplify-and-forward (AAF) protocol is considered. The te...
Karim G. Seddik, K. J. Ray Liu
WEA
2007
Springer
104views Algorithms» more  WEA 2007»
14 years 4 months ago
Dynamic Trees in Practice
Dynamic tree data structures maintain forests that change over time through edge insertions and deletions. Besides maintaining connectivity information in logarithmic time, they ca...
Robert Endre Tarjan, Renato Fonseca F. Werneck