Sciweavers

589 search results - page 117 / 118
» On the Use of Combining Rules in Relational Probability Tree...
Sort
View
EDBT
2010
ACM
177views Database» more  EDBT 2010»
14 years 5 days ago
Bridging the gap between intensional and extensional query evaluation in probabilistic databases
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...
Abhay Jha, Dan Olteanu, Dan Suciu
PODC
2006
ACM
13 years 11 months ago
Computing separable functions via gossip
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...
Damon Mosk-Aoyama, Devavrat Shah
SCVMA
2004
Springer
13 years 10 months ago
Comparison of Edge-Driven Algorithms for Model-Based Motion Estimation
3D-model-based tracking offers one possibility to explicate the manner in which spatial coherence can be exploited for the analysis of image sequences. Two seemingly different ap...
Hendrik Dahlkamp, Artur Ottlik, Hans-Hellmut Nagel
EPEW
2007
Springer
13 years 9 months ago
An Efficient Counter-Based Broadcast Scheme for Mobile Ad Hoc Networks
In mobile ad hoc networks (MANETs), broadcasting plays a fundamental role, diffusing a message from a given source node to all the other nodes in the network. Flooding is the simpl...
Aminu Mohammed, Mohamed Ould-Khaoua, Lewis M. Mack...
CCGRID
2010
IEEE
13 years 6 months ago
Availability Prediction Based Replication Strategies for Grid Environments
Volunteer-based grid computing resources are characteristically volatile and frequently become unavailable due to the autonomy that owners maintain over them. This resource volati...
Brent Rood, Michael J. Lewis