Sciweavers

3110 search results - page 160 / 622
» On the initialization of the DNMF algorithm
Sort
View
CIC
2004
118views Communications» more  CIC 2004»
15 years 7 months ago
An Efficient Delay Sensitive Multicast Routing Algorithm
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
Gang Feng
PDPTA
2004
15 years 7 months ago
Efficient Disk Replacement and Data Migration Algorithms for Large Disk Subsystems
Random data placement has recently emerged as an alternative to traditional data striping. From a performance perspective, it has been demonstrated to be an efficient and scalable...
Roger Zimmermann, Beomjoo Seo
JSAT
2008
122views more  JSAT 2008»
15 years 6 months ago
SAT Algorithms for Colouring Some Special Classes of Graphs: Some Theoretical and Experimental Results
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
Sriyankar Acharyya
ISCI
2007
108views more  ISCI 2007»
15 years 6 months ago
A degree-constrained QoS-aware routing algorithm for application layer multicast
Application layer multicast (ALM) provides a low-cost solution for multicast over the Internet. It overcomes the deployment hurdle of IP multicast by moving all multicast related ...
Baoliu Ye, Minyi Guo, Daoxu Chen, Sanglu Lu
ICCV
2003
IEEE
16 years 8 months ago
A Sparse Probabilistic Learning Algorithm for Real-Time Tracking
This paper addresses the problem of applying powerful pattern recognition algorithms based on kernels to efficient visual tracking. Recently Avidan [1] has shown that object recog...
Oliver M. C. Williams, Andrew Blake, Roberto Cipol...