2430 search results - page 266 / 486 » Computing Tutte Polynomials |
220
Voted
WIA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. State elimination is an intuitive and easy-to-implement algorithm that computes a regular expression from a finite-state automaton (FA). The size of a regular expression...
109
click to vote
IWPEC
2009
Springer
15 years 10 months ago
2009
Springer
In the p-Set Splitting problem we are given a universe U, a family F of subsets of U and a positive integer k and the objective is to find a partition of U into W and B such that...
120
click to vote
TAMC
2009
Springer
15 years 10 months ago
2009
Springer
We provide polynomial time data reduction rules for Connected Dominating Set in planar graphs and analyze these to obtain a linear kernel for the planar Connected Dominating Set pr...
122
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
We give near-optimal sketching and streaming algorithms for estimating Shannon entropy in the most general streaming model, with arbitrary insertions and deletions. This improves ...
155
click to vote
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
This paper presents a novel graph cut based segmentation approach with shape priors. The model incorporates statistical shape prior information with the active contour without edg...