Sciweavers

2269 search results - page 237 / 454
» Query Incentive Networks
Sort
View
EWSN
2004
Springer
16 years 6 months ago
ACE: An Emergent Algorithm for Highly Uniform Cluster Formation
The efficient subdivision of a sensor network into uniform, mostly non-overlapping clusters of physically close nodes is an important building block in the design of efficient uppe...
Haowen Chan, Adrian Perrig
WWW
2005
ACM
16 years 7 months ago
Association search in semantic web: search + inference
Association search is to search for certain instances in semantic web and then make inferences from and about the instances we have found. In this paper, we propose the problem of...
Bangyong Liang, Jie Tang, Juan-Zi Li
RV
2009
Springer
101views Hardware» more  RV 2009»
16 years 26 days ago
DMaC: Distributed Monitoring and Checking
Abstract. We consider monitoring and checking formally specified properties in a network. We are addressing the problem of deploying the checkers on different network nodes that ...
Wenchao Zhou, Oleg Sokolsky, Boon Thau Loo, Insup ...
181
Voted
SAC
2009
ACM
16 years 1 months ago
Diverse peer selection in collaborative web search
Effective peer selection for intelligent query routing is a challenge in collaborative peer-based Web search systems, especially unstructured networks that do not have any central...
Le-Shin Wu, Filippo Menczer
ICDT
2012
ACM
242views Database» more  ICDT 2012»
13 years 8 months ago
Win-move is coordination-free (sometimes)
In a recent paper by Hellerstein [15], a tight relationship was conjectured between the number of strata of a Datalog¬ program and the number of “coordination stages” require...
Daniel Zinn, Todd J. Green, Bertram Ludäscher