2654 search results - page 191 / 531 » On Pairing Inversion Problems |
181
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix, and it...
154
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
The bandwidth of a graph G on n vertices is the minimum b such that the vertices of G can be labeled from 1 to n such that the labels of every pair of adjacent vertices differ by ...
126
click to vote
ATAL
2003
Springer
15 years 11 months ago
2003
Springer
We show how it is possible to pair the NuSMV model checker with Akka, a software platform used to check validity of propositional modal formulas, to verify properties of multi-age...
227
click to vote
ESA
2010
Springer
15 years 7 months ago
2010
Springer
We consider the Minimum Vertex Cover problem in intersection graphs of axis-parallel rectangles on the plane. We present two algorithms: The first is an EPTAS for non-crossing rect...
163
click to vote
MM
2010
ACM
15 years 6 months ago
2010
ACM
In this paper, we consider the incoherence problem of the visual words in bag-of-words vocabularies. Different from existing work, which performs assignment of words based solely ...