139 search results - page 25 / 28 » Computing crossing numbers in quadratic time |
146
click to vote
MFCS
2007
Springer
16 years 5 days ago
2007
Springer
Suppose we are given a graph G together with two proper vertex k-colourings of G, α and β. How easily can we decide whether it is possible to transform α into β by recolouring...
211
click to vote
WADS
2009
Springer
16 years 19 days ago
2009
Springer
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
161
click to vote
EMSOFT
2009
Springer
16 years 18 days ago
2009
Springer
The major obstacle to use multicores for real-time applications is that we may not predict and provide any guarantee on real-time properties of embedded software on such platforms...
184
click to vote
BIBE
2005
IEEE
15 years 11 months ago
2005
IEEE
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
234
click to vote
COMPGEOM
2011
ACM
14 years 9 months ago
2011
ACM
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...