7913 search results - page 155 / 1583 » Information Collection on a Graph |
INFOCOM
2012
IEEE
12 years 22 days ago
2012
IEEE
—Collecting per-flow aggregates in high-speed links is challenging and usually requires traffic sampling to handle peak rates and extreme traffic mixes. Static selection of sa...
TMC
2012
12 years 20 days ago
2012
—We investigate the following fundamental question—how fast can information be collected from a wireless sensor network organized as tree? To address this, we explore and evalu...
LATIN
2004
Springer
14 years 3 months ago
2004
Springer
For several graph-theoretic parameters such as vertex cover and dominating set, it is known that if their sizes are bounded by k then the treewidth of the graph is bounded by some ...
MIR
2003
ACM
14 years 3 months ago
2003
ACM
Huge amount of manual efforts are required to annotate large image/video archives with text annotations. Several recent works attempted to automate this task by employing supervis...
ATAL
2006
Springer
14 years 2 months ago
2006
Springer
We study how decentralized agents can develop a shared vocabulary without global coordination. Answering this question can help us understand the emergence of many communication s...