Sciweavers

246 search results - page 38 / 50
» Dynamic Local Search for the Maximum Clique Problem
Sort
View
ICASSP
2011
IEEE
14 years 1 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
ICDM
2006
IEEE
145views Data Mining» more  ICDM 2006»
15 years 3 months ago
Stability Region Based Expectation Maximization for Model-based Clustering
In spite of the initialization problem, the ExpectationMaximization (EM) algorithm is widely used for estimating the parameters in several data mining related tasks. Most popular ...
Chandan K. Reddy, Hsiao-Dong Chiang, Bala Rajaratn...
ICIP
2007
IEEE
15 years 11 months ago
Markov Random Field Model-Based Edge-Directed Image Interpolation
Abstract-- This paper presents an edge-directed image interpolation algorithm. In the proposed algorithm, the edge directions are implicitly estimated with a statistical-based appr...
Min Li, Truong Q. Nguyen
MFCS
2009
Springer
15 years 2 months ago
An Improved Approximation Bound for Spanning Star Forest and Color Saving
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
Stavros Athanassopoulos, Ioannis Caragiannis, Chri...
TRANSCI
2008
94views more  TRANSCI 2008»
14 years 8 months ago
Routing for Relief Efforts
In the aftermath of a large disaster, the routing of vehicles carrying critical supplies can greatly impact the arrival times to those in need. Since it is critical that the deliv...
Ann Melissa Campbell, Dieter Vandenbussche, Willia...