6105 search results - page 917 / 1221 » A Parallel Algorithm for Bound-Smoothing |
195
click to vote
ICPPW
2007
IEEE
16 years 27 days ago
2007
IEEE
Obtaining location information by localization schemes for sensor nodes makes applications of wireless sensor networks (WSNs) more meaningful. Most of localization schemes only us...
154
click to vote
APPT
2007
Springer
16 years 26 days ago
2007
Springer
We investigate the problem of constructing the maximal number of node disjoint paths between two distinct nodes in Swapped/OTIS networks. A general construction of node disjoint pa...
162
click to vote
GBRPR
2007
Springer
16 years 25 days ago
2007
Springer
Segmentation algorithms based on an energy minimisation framework often depend on a scale parameter which balances a fit to data and a regularising term. Irregular pyramids are de...
187
click to vote
GRID
2007
Springer
16 years 25 days ago
2007
Springer
— Today’s system monitoring tools are capable of detecting system failures such as host failures, OS errors, and network partitions in near-real time. Unfortunately, the same c...
196
click to vote
GRID
2007
Springer
16 years 25 days ago
2007
Springer
—Due to the dynamic nature of grid environments, schedule algorithms always need assistance of a long-time-ahead load prediction to make decisions on how to use grid resources ef...