Sciweavers

39 search results - page 6 / 8
» Plottable Real Number Functions and the Computable Graph The...
Sort
View
SCALESPACE
2007
Springer
15 years 9 months ago
Level Set Methods for Watershed Image Segmentation
In this work a marker-controlled and regularized watershed segmentation is proposed. Only a few previous studies address the task of regularizing the obtained watershed lines from ...
Xue-Cheng Tai, Erlend Hodneland, Joachim Weickert,...
STOC
2009
ACM
152views Algorithms» more  STOC 2009»
15 years 10 months ago
Green's conjecture and testing linear-invariant properties
A system of linear equations in p unknowns Mx = b is said to have the removal property if every set S ⊆ {1, . . . , n} which contains o(np− ) solutions of Mx = b can be turned...
Asaf Shapira
GC
2007
Springer
15 years 3 months ago
Local Topological Toughness and Local Factors
We localize and strengthen Katona’s idea of an edge-toughness to a local topological toughness. We disprove a conjecture of Katona concerning the connection between edgetoughnes...
Frank Göring, Gyula Y. Katona
172
Voted
COCO
1997
Springer
144views Algorithms» more  COCO 1997»
15 years 7 months ago
Polynomial Vicinity Circuits and Nonlinear Lower Bounds
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...
Kenneth W. Regan
ICNP
2009
IEEE
15 years 10 months ago
Scalable IP Lookups using Shape Graphs
—Recently, there has been much renewed interest in developing compact data structures for packet processing functions such as longest prefix-match for IP lookups. This has been ...
Haoyu Song, Murali S. Kodialam, Fang Hao, T. V. La...