Sciweavers

7 search results - page 1 / 2
» Fast greedy weighted fusion
Sort
View
ICS
2000
Tsinghua U.
13 years 8 months ago
Fast greedy weighted fusion
Loop fusion is important to optimizing compilers because it is an important tool in managing the memory hierarchy. By fusing loops that use the same data elements, we can reduce t...
Ken Kennedy
SIAMCOMP
2002
113views more  SIAMCOMP 2002»
13 years 4 months ago
Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
Given a set V of n points in Rd and a real constant t > 1, we present the first O(n log n)-time algorithm to compute a geometric t-spanner on V . A geometric t-spanner on V is a...
Joachim Gudmundsson, Christos Levcopoulos, Giri Na...
CDC
2010
IEEE
226views Control Systems» more  CDC 2010»
12 years 12 months ago
Fast primal-dual projected linear iterations for distributed consensus in constrained convex optimization
In this paper we study the constrained consensus problem, i.e. the problem of reaching a common point from the estimates generated by multiple agents that are constrained to lie in...
Ion Necoara, Ioan Dumitrache, Johan A. K. Suykens
AAAI
2008
13 years 7 months ago
Multimodal People Detection and Tracking in Crowded Scenes
This paper presents a novel people detection and tracking method based on a multi-modal sensor fusion approach that utilizes 2D laser range and camera data. The data points in the...
Luciano Spinello, Rudolph Triebel, Roland Siegwart
SRDS
2010
IEEE
13 years 2 months ago
Shedding Light on Enterprise Network Failures Using Spotlight
Abstract--Fault localization in enterprise networks is extremely challenging. A recent approach called Sherlock makes some headway into this problem by using an inference algorithm...
Dipu John, Pawan Prakash, Ramana Rao Kompella, Ran...