153 search results - page 19 / 31 » On an equivalence in discrete extremal problems |
PPOPP
2005
ACM
14 years 9 days ago
2005
ACM
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
VALUETOOLS
2006
ACM
14 years 21 days ago
2006
ACM
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
ICRA
2008
IEEE
14 years 1 months ago
2008
IEEE
— We present a new algorithm for solving the global localization problem called Frozen-Time Smoother (FTS). Time is ‘frozen’, in the sense that the belief always refers to th...
IVC
2010
13 years 5 months ago
2010
We present an algorithm for the layered segmentation of video data in multiple views. The approach is based on computing the parameters of a layered representation of the scene in...
ASPDAC
2008
ACM
13 years 8 months ago
2008
ACM
Nowadays a placement problem often involves multi-million objects and excessive fixed blockages. We present a new global placement algorithm that scales well to the modern large-s...