933 search results - page 38 / 187 » Monotone Complexity of a Pair |
GD
2007
Springer
14 years 1 months ago
2007
Springer
The odd crossing number of G is the smallest number of pairs of edges that cross an odd number of times in any drawing of G. We show that there always is a drawing realizing the o...
LREC
2008
13 years 9 months ago
2008
This paper presents a corpus-based study of the discourse connective in contrast. The corpus data are drawn from the British National Corpus (BNC) and are analyzed at the levels o...
CCIA
2007
Springer
14 years 1 months ago
2007
Springer
With the arrival of high throughput genotyping techniques, the detection of likely genotyping errors is becoming an increasingly important problem. In this paper we are interested...
ICIP
2004
IEEE
14 years 9 months ago
2004
IEEE
For reconstructing a complex object wavefront from digital holograms, we propose a new penalized-likelihood approach based on the measurement statistics and edge-preserving regula...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
Referring to the query complexity of property testing, we prove the existence of a rich hierarchy of corresponding complexity classes. That is, for any relevant function q, we prov...