Abstract. We give an overview of the main ideas and tools that have been employed in uncertain geometry. We show how several recognition problems in computer vision can be translat...
Many of the recent, and more effective, retrieval models have incorporated dependencies between the terms in the query. In this paper, we advance this query representation one st...
In this paper, we present a new framework of video object
segmentation, in which we formulate the task of extracting
prominent objects from a scene as the problem of hypergraph
...
We study approximation solutions for the densest k-subgraph problem (DS-k) on several classes of intersection graphs. We adopt the concept of -quasi elimination orders, introduced ...
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...