Sciweavers

332 search results - page 63 / 67
» Complexity analysis of a decentralised graph colouring algor...
Sort
View
ICDE
2010
IEEE
322views Database» more  ICDE 2010»
14 years 7 months ago
XML-Based Computation for Scientific Workflows
Scientific workflows are increasingly used for rapid integration of existing algorithms to form larger and more comgrams. Such workflows promise to provide more abstract, yet execu...
Bertram Ludäscher, Daniel Zinn, Shawn Bowers
MOBICOM
2005
ACM
14 years 1 months ago
MAP: medial axis based geometric routing in sensor networks
One of the challenging tasks in the deployment of dense wireless networks (like sensor networks) is in devising a routing scheme for node to node communication. Important consider...
Jehoshua Bruck, Jie Gao, Anxiao Jiang
PODC
2003
ACM
14 years 26 days ago
Geometric ad-hoc routing: of theory and practice
All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of ad-hoc rout...
Fabian Kuhn, Roger Wattenhofer, Yan Zhang, Aaron Z...
WWW
2006
ACM
14 years 8 months ago
Site level noise removal for search engines
The currently booming search engine industry has determined many online organizations to attempt to artificially increase their ranking in order to attract more visitors to their ...
André Luiz da Costa Carvalho, Paul-Alexandr...
ESA
2009
Springer
122views Algorithms» more  ESA 2009»
14 years 2 months ago
Bounded Budget Betweenness Centrality Game for Strategic Network Formations
In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in or...
Xiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhan...