Sciweavers

7648 search results - page 33 / 1530
» A Data Locality Optimizing Algorithm
Sort
View
SODA
2004
ACM
89views Algorithms» more  SODA 2004»
14 years 11 months ago
Approximate local search in combinatorial optimization
srn.com/abstract=423560
James B. Orlin, Abraham P. Punnen, Andreas S. Schu...
POPL
2007
ACM
15 years 10 months ago
Locality approximation using time
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
Xipeng Shen, Jonathan Shaw, Brian Meeker, Chen Din...
66
Voted
ICRA
2009
IEEE
145views Robotics» more  ICRA 2009»
15 years 4 months ago
Distributed maximum a posteriori estimation for multi-robot cooperative localization
— This paper presents a distributed Maximum A Posteriori (MAP) estimator for multi-robot Cooperative Localization (CL). As opposed to centralized MAP-based CL, the proposed algor...
Esha D. Nerurkar, Stergios I. Roumeliotis, Agostin...
71
Voted
ICML
2008
IEEE
15 years 10 months ago
Localized multiple kernel learning
Recently, instead of selecting a single kernel, multiple kernel learning (MKL) has been proposed which uses a convex combination of kernels, where the weight of each kernel is opt...
Ethem Alpaydin, Mehmet Gönen
IPPS
1997
IEEE
15 years 1 months ago
Optimizing Parallel Bitonic Sort
Sorting is an important component of many applications, and parallel sorting algorithms have been studied extensively in the last three decades. One of the earliest parallel sorti...
Mihai F. Ionescu