54 search results - page 5 / 11 » The Complexity of Perfect Matching Problems on Dense Hypergr... |
MVA
2007
13 years 10 months ago
2007
In this paper we present an evaluation method for stereo matching systems and sensors especially for real world indoor applications. We estimate ground truth reference images by i...
DAM
2006
13 years 8 months ago
2006
Given a rectangular array where entries represent the pixels of a digitalized image, we consider the problem of reconstructing an image from the number of occurrences of each colo...
TAMC
2009
Springer
14 years 3 months ago
2009
Springer
We study a new model of computation called stream checking on graph problems where a space-limited verifier has to verify a proof sequentially (i.e., it reads the proof as a strea...
SODA
2004
ACM
13 years 10 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
MKWI
2008
13 years 10 months ago
2008
: Matchmaking between offers and requests is an essential mechanism in electronic market places. Description Logics have been proposed as a appropriate framework for representing o...