356 search results - page 22 / 72 » A Most General Edge Elimination Polynomial - Thickening of E... |
159
click to vote
PCM
2005
Springer
15 years 11 months ago
2005
Springer
In this paper we propose a robust text segmentation method in complex background. The proposed method first utilizes the K-means algorithm to decompose a detected text block into ...
171
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
139
click to vote
SAT
2007
Springer
16 years 6 days ago
2007
Springer
Abstract. In this paper we study NP-hard weighted satisfiability optimization problems for the class 2-CNF providing worst-case upper time bounds. Moreover we consider the monoton...
181
Voted
ESA
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We provide new tools, such as k-troikas and good subtreerepresentations, that allow us to give fast and simple algorithms computing branchwidth. We show that a graph G ha...
150
click to vote
ALMOB
2008
15 years 6 months ago
2008
Background: In recent years, quartet-based phylogeny reconstruction methods have received considerable attentions in the computational biology community. Traditionally, the accura...