Sciweavers

16666 search results - page 393 / 3334
» Descriptive and Computational Complexity
Sort
View
ACCV
2006
Springer
16 years 25 days ago
Waterfall Segmentation of Complex Scenes
Abstract. We present an image segmentation technique using the morphological Waterfall algorithm. Improvements in the segmentation are brought about by using improved gradients. Th...
Allan Hanbury, Beatriz Marcotegui
ECBS
2005
IEEE
103views Hardware» more  ECBS 2005»
16 years 13 days ago
Improving the System/Software Engineering Interface for Complex System Development
At the 2004 Engineering of Computer Based Systems (ECBS) Technical Committee meeting, the ECBS Executive Committee agreed that a guideline on Integrated System and Software Engine...
Stephanie M. White
COCO
2005
Springer
106views Algorithms» more  COCO 2005»
16 years 11 days ago
The Complexity of the Inertia and Some Closure Properties of GapL
The inertia of an n × n matrix A is defined as the triple (i+(A), i−(A), i0(A)), where i+(A), i−(A), and i0(A) are the number of eigenvalues of A, counting multiplicities, w...
Thanh Minh Hoang, Thomas Thierauf
CPM
2005
Springer
97views Combinatorics» more  CPM 2005»
16 years 11 days ago
On the Complexity of Sparse Exon Assembly
Gene structure prediction is one of the most important problems in computational molecular biology. It involves two steps: the first is finding the evidence (e.g. predicting spl...
Carmel Kent, Gad M. Landau, Michal Ziv-Ukelson
ISSAC
2005
Springer
115views Mathematics» more  ISSAC 2005»
16 years 10 days ago
On the complexity of factoring bivariate supersparse (Lacunary) polynomials
We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size....
Erich Kaltofen, Pascal Koiran