Sciweavers

1629 search results - page 97 / 326
» Hardness Results and Efficient Algorithms for Graph Powers
Sort
View
SKG
2006
IEEE
16 years 1 months ago
Service Search Strategy Based on Graph in Grid Environment
Service discovery is a key concept in a distributed Grid environment. The first step towards Grid implement is the discovery of services. In this paper, we build a new Grid servic...
Zilin Song, Weihua Ai, Yi Wang, Liang Wu
225
Voted
CCR
2010
184views more  CCR 2010»
15 years 7 months ago
Characterising temporal distance and reachability in mobile and online social networks
The analysis of social and technological networks has attracted a lot of attention as social networking applications and mobile sensing devices have given us a wealth of real data...
John Tang, Mirco Musolesi, Cecilia Mascolo, Vito L...
167
Voted
CISIM
2008
IEEE
16 years 1 months ago
Scheduling in Multiprocessor System Using Genetic Algorithms
Multiprocessors have emerged as a powerful computing means for running real-time applications, especially where a uniprocessor system would not be sufficient enough to execute all...
Keshav P. Dahal, M. Alamgir Hossain, Benny Varghes...

Publication
592views
17 years 3 months ago
Coupling Graph Cuts and Level Sets
"This paper presents an efficient algorithm for solving one sort of region-based active contour models, i.e. the active contours without edges model. We develop the link betwe...
Xiang Zeng, Wei Chen, and Qunsheng Peng
206
Voted
INFOCOM
2007
IEEE
16 years 1 months ago
Low-Power Distributed Event Detection in Wireless Sensor Networks
Abstract—In this paper we address the problem of energyefficient event detection in wireless sensor networks (WSNs). Duty cycling is a fundamental approach to conserving energy i...
Yanmin Zhu, Yunhao Liu, Lionel M. Ni, Z. Zhang