2430 search results - page 183 / 486 » Computing Tutte Polynomials |
120
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
Segmentation of pulmonary nodules in chest radiographs is a difficult task due to heavy noise and superposition of ribs, vessels, and other anatomical structures in lung field. In...
145
click to vote
ISSAC
2007
Springer
15 years 10 months ago
2007
Springer
We describe some major recent progress in exact and symbolic linear algebra. These advances concern the improvement of complexity estimates for fundamental problems such as linear...
142
click to vote
FOCS
2005
IEEE
15 years 10 months ago
2005
IEEE
We present a non-malleable commitment scheme that retains its security properties even when concurrently executed a polynomial number of times. That is, a manin-the-middle adversa...
155
click to vote
LICS
2005
IEEE
15 years 10 months ago
2005
IEEE
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
158
click to vote
ESA
2005
Springer
15 years 10 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...