Sciweavers

4124 search results - page 231 / 825
» Improved Algorithms for Data Migration
Sort
View
MUE
2008
IEEE
173views Multimedia» more  MUE 2008»
15 years 10 months ago
Efficient Data Dissemination in Mobile P2P Ad-Hoc Networks for Ubiquitous Computing
In this paper we propose Rank-Based Broadcast (RBB) algorithm using High Order Markov Chain (HOMC) with weight values in mobile p2p ad-hoc networks (MOPNET) for ubiquitous. RBB us...
Do-Hoon Kim, Myoung Rak Lee, Longzhe Han, Hoh Pete...
DMIN
2006
144views Data Mining» more  DMIN 2006»
15 years 5 months ago
Discovering Assignment Rules in Workforce Schedules Using Data Mining
Discovering hidden patterns in large sets of workforce schedules to gain insight into the potential knowledge in workforce schedules are crucial to better understanding the workfor...
Jihong Yan
ICIP
2003
IEEE
16 years 6 months ago
A refined ICP algorithm for robust 3-D correspondence estimation
Robust registration of two 3-D point sets is a common problem in computer vision. The Iterative Closest Point (ICP) algorithm is undoubtedly the most popular algorithm for solving...
Heinrich Niemann, Jochen Schmidt, Timo Zinße...
JDCTA
2010
92views more  JDCTA 2010»
14 years 11 months ago
Several Incomplete Sort Algorithms for Getting the Median Value
To quickly get the median value of any given sequence is very important in many research fields. Some popular sort algorithms are discussed in this paper. Selection sort algorithm...
Fuguo Dong
CSC
2008
15 years 5 months ago
Efficient and Effective Practical Algorithms for the Set-Covering Problem
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
Qi Yang, Jamie McPeek, Adam Nofsinger