Sciweavers

7930 search results - page 369 / 1586
» Greedy in Approximation Algorithms
Sort
View
ICIP
2009
IEEE
16 years 7 months ago
Improved Global Cardiac Tractography With Simulated Annealing
We propose a new fibre tracking algorithm for cardiac DTMRI that parts with the locally "greedy" paradigm intrinsic to conventional tracking algorithms. We formulate the...
ICCAD
2002
IEEE
103views Hardware» more  ICCAD 2002»
16 years 3 months ago
A realistic variable voltage scheduling model for real-time applications
Voltage scheduling is indispensable for exploiting the benefit of variable voltage processors. Though extensive research has been done in this area, current processor limitations...
Bren Mochocki, Xiaobo Sharon Hu, Gang Quan
ICC
2008
IEEE
161views Communications» more  ICC 2008»
16 years 1 months ago
Joint Power Control and Link Scheduling in Wireless Networks for Throughput Optimization
—This paper concerns the problem of finding the minimum-length TDMA frame of a power-controlled wireless network subject to traffic demands and SINR (signalto-interference-plus...
Liqun Fu, Soung Chang Liew, Jianwei Huang
ICPR
2008
IEEE
16 years 1 months ago
Multi-stage branch-and-bound for maximum variance disparity clustering
A split-and-merge framework based on a maximum variance criterion is proposed for disparity clustering. The proposed algorithm transforms low-level stereo disparity information to...
Ninad Thakoor, Venkat Devarajan, Jean Gao
SCAM
2008
IEEE
16 years 1 months ago
Constructing Subtle Faults Using Higher Order Mutation Testing
Traditional mutation testing considers only first order mutants, created by the injection of a single fault. Often these first order mutants denote trivial faults that are easil...
Yue Jia, Mark Harman