Sciweavers

597 search results - page 12 / 120
» Long term tracking using Bayesian networks
Sort
View
MSWIM
2004
ACM
14 years 1 months ago
Exploring long lifetime routing (LLR) in ad hoc networks
In mobile ad hoc networks, node mobility causes links between nodes to break frequently, thus terminating the lifetime of the routes containing those links. An alternative route h...
Zhao Cheng, Wendi Beth Heinzelman
NIPS
2008
13 years 10 months ago
Bayesian Network Score Approximation using a Metagraph Kernel
Many interesting problems, including Bayesian network structure-search, can be cast in terms of finding the optimum value of a function over the space of graphs. However, this fun...
Benjamin Yackley, Eduardo Corona, Terran Lane
SIGIR
2008
ACM
13 years 8 months ago
A few examples go a long way: constructing query models from elaborate query formulations
We address a specific enterprise document search scenario, where the information need is expressed in an elaborate manner. In our scenario, information needs are expressed using a...
Krisztian Balog, Wouter Weerkamp, Maarten de Rijke
NETWORKING
2004
13 years 9 months ago
Modeling the Short-Term Unfairness of IEEE 802.11 in Presence of Hidden Terminals
: IEEE 802.11 exhibits both short-term and long-term unfairness [15]. The short-term fairness automatically gives rise to long-term fairness, but not vice versa [11]. When we thoro...
Zhifei Li, Sukumar Nandi, Anil K. Gupta
INFOCOM
2003
IEEE
14 years 1 months ago
Optimal Sliding-Window Strategies in Networks with Long Round-Trip Delays
— A method commonly used for packet flow control over connections with long round-trip delays is “sliding windows”. In general, for a given loss rate, a larger window size a...
Lavy Libman, Ariel Orda