Sciweavers

6045 search results - page 250 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
DLT
2008
15 years 8 months ago
Derivation Tree Analysis for Accelerated Fixed-Point Computation
We show that for several classes of idempotent semirings the least fixed-point of a polynomial system of equations X = f(X) is equal to the least fixed-point of a linear system obt...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
CONCUR
2005
Springer
16 years 23 days ago
Type-Directed Concurrency
Abstract. We introduce a novel way to integrate functional and concurrent programming based on intuitionistic linear logic. The functional core arises from interpreting proof reduc...
Deepak Garg, Frank Pfenning
CVPR
2011
IEEE
15 years 4 months ago
Globally-Optimal Greedy Algorithms for Tracking a Variable Number of Objects
We analyze the computational problem of multi-object tracking in video sequences. We formulate the problem using a cost function that requires estimating the number of tracks, as ...
Hamed Pirsiavash, Deva Ramanan, Charless Fowlkes

Publication
337views
16 years 10 months ago
Redistribution Mechanisms for Assignment of Heterogeneous Objects
There are p heterogeneous objects to be assigned to n competing agents (n > p) each with unit demand. It is required to design a Groves mechanism for this assignment problem ...
Sujit Gujar, Y Narahari
STOC
2007
ACM
106views Algorithms» more  STOC 2007»
16 years 7 months ago
One sketch for all: fast algorithms for compressed sensing
Compressed Sensing is a new paradigm for acquiring the compressible signals that arise in many applications. These signals can be approximated using an amount of information much ...
Anna C. Gilbert, Martin J. Strauss, Joel A. Tropp,...