Sciweavers

334 search results - page 35 / 67
» Dynamic Three-Dimensional Linear Programming
Sort
View
78
Voted
TACAS
2009
Springer
127views Algorithms» more  TACAS 2009»
15 years 4 months ago
From Tests to Proofs
We describe the design and implementation of an automatic invariant generator for imperative programs. While automatic invariant generation through constraint solving has been exte...
Ashutosh Gupta, Rupak Majumdar, Andrey Rybalchenko
ECOOP
2010
Springer
15 years 2 months ago
Recency Types for Analyzing Scripting Languages
Abstract. With the current surge of scripting technologies, large programs are being built with dynamically typed languages. As these programs grow in size, semantics-based tools g...
Phillip Heidegger, Peter Thiemann
JMLR
2012
13 years 2 days ago
Maximum Margin Temporal Clustering
Temporal Clustering (TC) refers to the factorization of multiple time series into a set of non-overlapping segments that belong to k temporal clusters. Existing methods based on e...
Minh Hoai Nguyen, Fernando De la Torre
FAW
2007
Springer
177views Algorithms» more  FAW 2007»
15 years 3 months ago
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
Hannes Moser, Somnath Sikdar
CVPR
2011
IEEE
14 years 7 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