Sciweavers

1941 search results - page 161 / 389
» On the Hardness of Approximate Reasoning
Sort
View
BILDMED
2011
225views Algorithms» more  BILDMED 2011»
14 years 10 months ago
Using Power Watersheds to Segment Benign Thyroid Nodules in Ultrasound Image Data
Thyroid nodule segmentation is a hard task due to different echo structures, textures and echogenicities in ultrasound (US) images as well as speckle noise. Currently, a typical c...
Eva N. K. Kollorz, Elli Angelopoulou, Michael Beck...
COCOON
2011
Springer
14 years 6 months ago
Finding Paths with Minimum Shared Edges
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
Masoud T. Omran, Jörg-Rüdiger Sack, Hami...
TSP
2012
14 years 2 months ago
Robust Multicast Beamforming for Spectrum Sharing-Based Cognitive Radios
Abstract—We consider a robust downlink beamforming optimization problem for secondary multicast transmission in a multiple-input multiple-output (MIMO) spectrum sharing cognitive...
Yongwei Huang, Qiang Li, Wing-Kin Ma, Shuzhong Zha...
LOPSTR
2007
Springer
16 years 19 days ago
A Flexible, (C)LP-Based Approach to the Analysis of Object-Oriented Programs
Static analyses of object-oriented programs usually rely on intermediate representations that respect the original semantics while having a more uniform and basic syntax. Most of t...
Mario Méndez-Lojo, Jorge Navas, Manuel V. H...
ICLP
1997
Springer
15 years 10 months ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...