Sciweavers

3008 search results - page 408 / 602
» Independence in connected graphs
Sort
View
MICCAI
2010
Springer
15 years 5 months ago
Segmentation Subject to Stitching Constraints: Finding Many Small Structures in a Large Image
International Conference on Medical Image Computing and Computer Assisted Intervention, Beijing, China, 20-24 September 2010 Extracting numerous cells in a large microscopic image...
Elena Bernardis, Stella X. Yu
SIAMDM
2010
84views more  SIAMDM 2010»
15 years 5 months ago
On Computing the Frequencies of Induced Subhypergraphs
Let F be an r-uniform hypergraph with f vertices, where f > r ≥ 3. In [12], R. Yuster posed the problem of whether there exists an algorithm which, for a given r-uniform hyper...
Brendan Nagle
CORR
2012
Springer
188views Education» more  CORR 2012»
14 years 2 months ago
A Logical Characterization of Constraint-Based Causal Discovery
We present a novel approach to constraintbased causal discovery, that takes the form of straightforward logical inference, applied to a list of simple, logical statements about ca...
Tom Claassen, Tom Heskes
ICCV
2007
IEEE
16 years 9 months ago
Globally Optimal Image Segmentation with an Elastic Shape Prior
So far global optimization techniques have been developed independently for the tasks of shape matching and image segmentation. In this paper we show that both tasks can in fact b...
Thomas Schoenemann, Daniel Cremers
DATE
2009
IEEE
102views Hardware» more  DATE 2009»
16 years 1 months ago
Register placement for high-performance circuits
—In modern sub-micron design, achieving low-skew clock distributions is facing challenges for high-performance circuits. Symmetric global clock distribution and clock tree synthe...
Mei-Fang Chiang, Takumi Okamoto, Takeshi Yoshimura