1149 search results - page 159 / 230 » What Are Iteration Theories |
MOBIHOC
2007
ACM
14 years 8 months ago
2007
ACM
We consider distributed opportunistic scheduling (DOS) in wireless ad-hoc networks, where many links contend for the same channel using random access. In such networks, distribute...
CIKM
2007
Springer
14 years 2 months ago
2007
Springer
As one of the most effective query expansion approaches, local feedback is able to automatically discover new query terms and improve retrieval accuracy for different retrieval ...
PODC
2006
ACM
14 years 2 months ago
2006
ACM
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
SIGIR
2005
ACM
14 years 2 months ago
2005
ACM
In this paper we use a Unified Relationship Matrix (URM) to represent a set of heterogeneous data objects (e.g., web pages, queries) and their interrelationships (e.g., hyperlinks...
EMSOFT
2009
Springer
14 years 19 days ago
2009
Springer
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...