Sciweavers

2842 search results - page 2 / 569
» Expansion and Search in Networks
Sort
View
PE
2010
Springer
170views Optimization» more  PE 2010»
13 years 4 months ago
Approximating passage time distributions in queueing models by Bayesian expansion
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
Giuliano Casale
TRECVID
2007
13 years 6 months ago
Etter Solutions Research Group TRECVID 2007
Etter Solutions Research Group participated in the TRECVID conference for the first time in 2007. We submitted five runs in the area of fully automatic search. Fully Automatic Sea...
David Etter
MSWIM
2003
ACM
13 years 11 months ago
Flooding strategy for target discovery in wireless networks
In this paper, we address a fundamental problem concerning the best flooding strategy to minimize cost and latency for target discovery in wireless networks. Should we flood the ...
Zhao Cheng, Wendi Beth Heinzelman
ICC
2007
IEEE
115views Communications» more  ICC 2007»
13 years 12 months ago
Cooperation and Routing in Multi-Hop Networks
— We study the cross-layer problem of combining routing and cooperative diversity in multi-hop, bandwidthconstrained networks with dedicated multiple access. Previous work in coo...
Elzbieta Beres, Raviraj Adve
SIGIR
2003
ACM
13 years 11 months ago
Re-examining the potential effectiveness of interactive query expansion
Much attention has been paid to the relative effectiveness of interactive query expansion versus automatic query expansion. Although interactive query expansion has the potential ...
Ian Ruthven