Sciweavers

201 search results - page 23 / 41
» Rough Set Approximation Based on Dynamic Granulation
Sort
View
ICDE
2006
IEEE
201views Database» more  ICDE 2006»
14 years 10 months ago
Approximate Data Collection in Sensor Networks using Probabilistic Models
Wireless sensor networks are proving to be useful in a variety of settings. A core challenge in these networks is to minimize energy consumption. Prior database research has propo...
David Chu, Amol Deshpande, Joseph M. Hellerstein, ...
CN
2006
75views more  CN 2006»
13 years 8 months ago
Dynamic online QoS routing schemes: Performance and bounds
Several dynamic QoS routing techniques have been recently proposed for new IP networks based on label forwarding. However, no extensive performance evaluation and comparison is av...
Antonio Capone, Luigi Fratta, Fabio Martignon
ATAL
2010
Springer
13 years 9 months ago
Point-based backup for decentralized POMDPs: complexity and new algorithms
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
Akshat Kumar, Shlomo Zilberstein
CGF
2008
157views more  CGF 2008»
13 years 8 months ago
Interactive Volume Rendering with Dynamic Ambient Occlusion and Color Bleeding
We propose a method for rendering volumetric data sets at interactive frame rates while supporting dynamic ambient occlusion as well as an approximation to color bleeding. In cont...
Timo Ropinski, Jennis Meyer-Spradow, Stefan Diepen...
ICANN
2009
Springer
14 years 1 months ago
An EM Based Training Algorithm for Recurrent Neural Networks
Recurrent neural networks serve as black-box models for nonlinear dynamical systems identification and time series prediction. Training of recurrent networks typically minimizes t...
Jan Unkelbach, Yi Sun, Jürgen Schmidhuber