3208 search results - page 120 / 642 » A Lower Bound for Primality |
160
click to vote
ECCV
2006
Springer
16 years 8 months ago
2006
Springer
For fitting an ellipse to a point sequence, ML (maximum likelihood) has been regarded as having the highest accuracy. In this paper, we demonstrate the existence of a "hyperac...
162
click to vote
MFCS
2004
Springer
15 years 11 months ago
2004
Springer
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
154
click to vote
APPROX
2007
Springer
15 years 10 months ago
2007
Springer
We show that the multi-commodity max-flow/min-cut gap for series-parallel graphs can be as bad as 2, matching a recent upper bound [8] for this class, and resolving one side of a ...
130
click to vote
AUSAI
2008
Springer
15 years 8 months ago
2008
Springer
The concept of Interchangeability was developed to deal with redundancy of values in the same domain. Conventional algorithms for detecting Neighborhood Interchangeability work by ...
136
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We consider Metropolis Glauber dynamics for sampling proper qcolourings of the n-vertex complete b-ary tree when 3 q b/2 ln(b). We give both upper and lower bounds on the mixing...