Sciweavers

1236 search results - page 53 / 248
» On the Hamkins approximation property
Sort
View
89
Voted
TALG
2010
110views more  TALG 2010»
14 years 11 months ago
Approximating fractional hypertree width
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
Dániel Marx
EVOW
2009
Springer
14 years 10 months ago
The Dynamic Knapsack Problem Revisited: A New Benchmark Problem for Dynamic Combinatorial Optimisation
Abstract. In this paper we propose a new benchmark problem for dynamic combinatorial optimisation. Unlike most previous benchmarks, we focus primarily on the underlying dynamics of...
Philipp Rohlfshagen, Xin Yao
128
Voted
CORR
2010
Springer
198views Education» more  CORR 2010»
14 years 9 months ago
Convex Graph Invariants
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
Venkat Chandrasekaran, Pablo A. Parrilo, Alan S. W...
CVPR
2012
IEEE
13 years 3 months ago
Discrete texture traces: Topological representation of geometric context
Modeling representations of image patches that are quasi-invariant to spatial deformations is an important problem in computer vision. In this paper, we propose a novel concept, t...
Jan Ernst, Maneesh Kumar Singh, Visvanathan Ramesh
96
Voted
JCDCG
2000
Springer
15 years 4 months ago
Structure Theorems for Systems of Segments
We study intersection properties of systems of segments in the plane. In particular, we show that there exists a constant c > 0 such that every system S of n straight-line segme...
János Pach, József Solymosi