Sciweavers

2583 search results - page 25 / 517
» On the Representation of Timed Polyhedra
Sort
View
SIAMDM
1998
95views more  SIAMDM 1998»
13 years 8 months ago
The Graphs with All Subgraphs T-Perfect
The richest class of t-perfect graphs known so far consists of the graphs with no so-called odd-K4. Clearly, these graphs have the special property that they are hereditary t-perfe...
A. M. H. Gerards, F. Bruce Shepherd
MP
2007
100views more  MP 2007»
13 years 8 months ago
Mixed-Integer Cuts from Cyclic Groups
We analyze a separation procedure for Mixed-Integer Programs related to the work of Gomory and Johnson on interpolated subadditive functions. This approach has its roots in the Go...
Matteo Fischetti, Cristiano Saturni
KES
2007
Springer
14 years 3 months ago
Time Discretisation Applied to Anomaly Detection in a Marine Engine
This paper introduces the problems associated with anomaly detection in a marine engine, and explains the benefits that the SAX representation brings to the field. Despite limita...
Ian Morgan, Honghai Liu, George Turnbull, David J....
JGAA
2007
123views more  JGAA 2007»
13 years 9 months ago
A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games
Abstract. Two-player win-lose games have a simple directed graph representation. Exploiting this, we develop graph theoretic techniques for finding Nash equilibria in such games. ...
Louigi Addario-Berry, Neil Olver, Adrian Vetta
CVPR
2012
IEEE
11 years 11 months ago
Real time robust L1 tracker using accelerated proximal gradient approach
Recently sparse representation has been applied to visual tracker by modeling the target appearance using a sparse approximation over a template set, which leads to the so-called ...
Chenglong Bao, Yi Wu, Haibin Ling, Hui Ji