393 search results - page 53 / 79 » The LCA Problem Revisited |
184
click to vote
ICDT
2009
ACM
16 years 2 months ago
2009
ACM
We study the problem of querying data sources that accept only a limited set of queries, such as sources accessible by Web services which can implement very large (potentially inf...
116
Voted
EWSN
2009
Springer
16 years 2 months ago
2009
Springer
Multi-hop cluster hierarchy has been presented as an organization for large wireless sensor networks (WSNs) that can provide scalable routing, data aggregation, and querying. In th...
101
Voted
ICASSP
2009
IEEE
15 years 8 months ago
2009
IEEE
This paper revisits the problem of source-channel coding for error-resilient video streaming, using redundant encoding. We propose a new method to jointly optimize the macroblock ...
87
Voted
SERSCISA
2009
Springer
15 years 8 months ago
2009
Springer
Node lookup mechanisms constitute an integral part of any overlay network, and hence also of anonymous communication networks. Today, most anonymizers use centralized directories, ...
116
click to vote
WOWMOM
2009
ACM
15 years 8 months ago
2009
ACM
Random Walks (RWs) have been considered for information dissemination in large scale, dynamic and unstructured environments, as they are scalable, robust to topology changes and d...