Sciweavers

563 search results - page 90 / 113
» Computing approximate PSD factorizations
Sort
View
ECAI
2006
Springer
14 years 1 months ago
Least Squares SVM for Least Squares TD Learning
Abstract. We formulate the problem of least squares temporal difference learning (LSTD) in the framework of least squares SVM (LS-SVM). To cope with the large amount (and possible ...
Tobias Jung, Daniel Polani
ANCS
2008
ACM
13 years 12 months ago
Performing time-sensitive network experiments
Time-sensitive network experiments are difficult. There are major challenges involved in generating high volumes of sufficiently realistic traffic. Additionally, accurately measur...
Neda Beheshti, Yashar Ganjali, Monia Ghobadi, Nick...
SDM
2008
SIAM
118views Data Mining» more  SDM 2008»
13 years 11 months ago
Massive-Scale Kernel Discriminant Analysis: Mining for Quasars
We describe a fast algorithm for kernel discriminant analysis, empirically demonstrating asymptotic speed-up over the previous best approach. We achieve this with a new pattern of...
Ryan Riegel, Alexander Gray, Gordon Richards
WCNC
2010
IEEE
13 years 8 months ago
On MIMO Cognitive Radios with Antenna Selection
—With the ever increasing interest in multiple-input multiple-output (MIMO) cognitive radio (CR) systems, reducing the costs associated with RF-chains at the radio front end beco...
Muhammad Fainan Hanif, Peter J. Smith
ADHOCNOW
2010
Springer
13 years 8 months ago
On Minimizing the Sum of Sensor Movements for Barrier Coverage of a Line Segment
A set of sensors establishes barrier coverage of a given line segment if every point of the segment is within the sensing range of a sensor. Given a line segment I, n mobile sensor...
Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc...