Sciweavers

2542 search results - page 308 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
GIS
2009
ACM
15 years 10 months ago
Dynamic network data exploration through semi-supervised functional embedding
The paper presents a framework for semi-supervised nonlinear embedding methods useful for exploratory analysis and visualization of spatio-temporal network data. The method provid...
Alexei Pozdnoukhov
ATAL
2006
Springer
15 years 10 months ago
A hierarchical approach to efficient reinforcement learning in deterministic domains
Factored representations, model-based learning, and hierarchies are well-studied techniques for improving the learning efficiency of reinforcement-learning algorithms in large-sca...
Carlos Diuk, Alexander L. Strehl, Michael L. Littm...
ECAI
2006
Springer
15 years 10 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
CVPR
2010
IEEE
15 years 9 months ago
Robust Piecewise-Planar 3D Reconstruction and Completion from Large-Scale Unstructured Point Data
In this paper, we present a novel method, the first to date to our knowledge, which is capable of directly and automatically producing a concise and idealized 3D representation f...
Anne-Laure Chauve, Patrick Labatut, Jean-Philippe ...
CONEXT
2008
ACM
15 years 8 months ago
ISP-friendly peer matching without ISP collaboration
In peer-to-peer (P2P) systems, a receiver needs to be matched with multiple senders, because peers have limited capacity and reliability. Efficient peer matching can reduce the co...
Cheng-Hsin Hsu, Mohamed Hefeeda