Sciweavers

334 search results - page 25 / 67
» Improved Algorithms and Complexity Results for Power Dominat...
Sort
View
TSMC
2008
138views more  TSMC 2008»
13 years 7 months ago
Image Thresholding Using Graph Cuts
A novel thresholding algorithm is presented in this paper to improve image segmentation performance at a low computational cost. The proposed algorithm uses a normalized graphcut m...
Wenbing Tao, Hai Jin, Yimin Zhang, Liman Liu, Desh...
WEBI
2007
Springer
14 years 1 months ago
Improving Performance of Web Services Query Matchmaking with Automated Knowledge Acquisition
There is a critical need to design and develop tools tract away the fundamental complexity of XML-based Web services specifications and toolkits, and provide an elegant, intuitive...
Chaitali Gupta, Rajdeep Bhowmik, Michael R. Head, ...
ICS
2009
Tsinghua U.
14 years 2 months ago
Adagio: making DVS practical for complex HPC applications
Power and energy are first-order design constraints in high performance computing. Current research using dynamic voltage scaling (DVS) relies on trading increased execution time...
Barry Rountree, David K. Lowenthal, Bronis R. de S...
ACIVS
2006
Springer
14 years 1 months ago
Improvement of Conventional Deinterlacing Methods with Extrema Detection and Interpolation
Abstract. This article presents a new algorithm for spatial deinterlacing that could easily be integrated in a more complete deinterlacing system, typically a spatio-temporal motio...
Jérôme Roussel, Pascal Bertolino, Mar...
WADS
2009
Springer
291views Algorithms» more  WADS 2009»
14 years 2 months ago
On the Power of the Semi-Separated Pair Decomposition
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Mic...