77 search results - page 9 / 16 » A Note on the Asymptotics and Computational Complexity of Gr... |
TSMC
2008
13 years 7 months ago
2008
A novel thresholding algorithm is presented in this paper to improve image segmentation performance at a low computational cost. The proposed algorithm uses a normalized graphcut m...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
BMCBI
2010
13 years 7 months ago
2010
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
WG
1998
Springer
13 years 11 months ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
PODC
2009
ACM
14 years 8 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...