Sciweavers

9849 search results - page 337 / 1970
» Algorithms and Experiments for the Webgraph
Sort
View
ATAL
2007
Springer
16 years 1 months ago
Batch reinforcement learning in a complex domain
Temporal difference reinforcement learning algorithms are perfectly suited to autonomous agents because they learn directly from an agent’s experience based on sequential actio...
Shivaram Kalyanakrishnan, Peter Stone
TKDE
2002
123views more  TKDE 2002»
15 years 7 months ago
Coordinated Placement and Replacement for Large-Scale Distributed Caches
In a large-scale information system such as a digital library or the web, a set of distributed caches can improve their effectiveness by coordinating their data placement decisions...
Madhukar R. Korupolu, Michael Dahlin
202
Voted
ICPP
2008
IEEE
16 years 1 months ago
Challenges and Advances in Parallel Sparse Matrix-Matrix Multiplication
We identify the challenges that are special to parallel sparse matrix-matrix multiplication (PSpGEMM). We show that sparse algorithms are not as scalable as their dense counterpar...
Aydin Buluç, John R. Gilbert
194
Voted
ICDM
2007
IEEE
119views Data Mining» more  ICDM 2007»
16 years 1 months ago
Reducing UK-Means to K-Means
This paper proposes an optimisation to the UK-means algorithm, which generalises the k-means algorithm to handle objects whose locations are uncertain. The location of each object...
Sau Dan Lee, Ben Kao, Reynold Cheng
202
Voted
IROS
2006
IEEE
205views Robotics» more  IROS 2006»
16 years 1 months ago
Good Image Features for Bearing-only SLAM
Abstract— In this paper, we propose an algorithm for extracting and selecting SIFT (scale-invariant feature transform) visual features for bearing-only SLAM in indoor environment...
Xiang Wang, Hong Zhang