Sciweavers

393 search results - page 69 / 79
» Convex Programming Methods for Global Optimization
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
Contour-based hidden Markov model to segment 2D ultrasound images
The segmentation of ultrasound images is challenging due to the difficulty of appropriate modeling of their appearance variations including speckle as well as signal dropout. We ...
Xiaoning Qian, Byung-Jun Yoon
IPPS
2005
IEEE
14 years 1 months ago
Automatic Support for Irregular Computations in a High-Level Language
The problem of writing high performance parallel applications becomes even more challenging when irregular, sparse or adaptive methods are employed. In this paper we introduce com...
Jimmy Su, Katherine A. Yelick
ISPD
2000
ACM
113views Hardware» more  ISPD 2000»
13 years 12 months ago
Floorplan area minimization using Lagrangian relaxation
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...
Fung Yu Young, Chris C. N. Chu, W. S. Luk, Y. C. W...
JCB
2006
215views more  JCB 2006»
13 years 7 months ago
Protein Fold Recognition Using Segmentation Conditional Random Fields (SCRFs)
Protein fold recognition is an important step towards understanding protein three-dimensional structures and their functions. A conditional graphical model, i.e., segmentation con...
Yan Liu 0002, Jaime G. Carbonell, Peter Weigele, V...
MOBIHOC
2006
ACM
14 years 7 months ago
Distributed localization using noisy distance and angle information
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes, along with additional local info...
Amitabh Basu, Jie Gao, Joseph S. B. Mitchell, Giri...