620 search results - page 22 / 124 » A Simple and Fast Min-cut Algorithm |
118
click to vote
BMCBI
2008
15 years 2 months ago
2008
Background: Due to recent progress in genome sequencing, more and more data for phylogenetic reconstruction based on rearrangement distances between genomes become available. Howe...
218
click to vote
ICDE
2002
IEEE
16 years 3 months ago
2002
IEEE
Network, web, and disk I/O traffic are usually bursty, self-similar [9, 3, 5, 6] and therefore can not be modeled adequately with Poisson arrivals[9]. However, we do want to model...
125
click to vote
COCOON
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We introduce a generic algorithmic technique and apply it on decision and counting versions of graph coloring. Our approach is based on the following idea: either a graph...
124
click to vote
PAMI
2010
15 years 10 days ago
2010
While feature point recognition is a key component of modern approaches to object detection, existing approaches require computationally expensive patch preprocessing to handle pe...
224
click to vote
CCECE
2011
IEEE
14 years 1 months ago
2011
IEEE
— Although "Adaptive Mesh" is regarded as complicating method for object tracking accompanied with many controversies and obstacles, but it has been proposed that such ...