Sciweavers

120 search results - page 18 / 24
» Low Complexity Algorithms for Linear Recurrences
Sort
View
ICRA
2007
IEEE
165views Robotics» more  ICRA 2007»
14 years 1 months ago
Probabilistic Appearance Based Navigation and Loop Closing
— This paper describes a probabilistic framework for navigation using only appearance data. By learning a generative model of appearance, we can compute not only the similarity o...
Mark Cummins, Paul M. Newman
ICASSP
2010
IEEE
13 years 7 months ago
Stability analysis of an adaptive Wiener structure
In the context of digital pre-distortion, a typical requirement is to identify the power amplifier with stringently low computational complexity. Accordingly, we consider a simpl...
Robert Dallinger, Markus Rupp
RECSYS
2010
ACM
13 years 5 months ago
List-wise learning to rank with matrix factorization for collaborative filtering
A ranking approach, ListRank-MF, is proposed for collaborative filtering that combines a list-wise learning-to-rank algorithm with matrix factorization (MF). A ranked list of item...
Yue Shi, Martha Larson, Alan Hanjalic
SPAA
2005
ACM
14 years 27 days ago
Dynamic circular work-stealing deque
The non-blocking work-stealing algorithm of Arora, Blumofe, and Plaxton (henceforth ABP work-stealing) is on its way to becoming the multiprocessor load balancing technology of ch...
David Chase, Yossi Lev
CORR
2010
Springer
105views Education» more  CORR 2010»
13 years 2 months ago
Universal and Robust Distributed Network Codes
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko, Lin...