Sciweavers

3049 search results - page 580 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
TPDS
2008
136views more  TPDS 2008»
13 years 8 months ago
Data Gathering with Tunable Compression in Sensor Networks
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...
Yang Yu, Bhaskar Krishnamachari, Viktor K. Prasann...
TCSV
2002
161views more  TCSV 2002»
13 years 8 months ago
Blocking artifact detection and reduction in compressed data
A novel frequency-domain technique for image blocking artifact detection and reduction is presented in this paper. The algorithm first detects the regions of the image which presen...
George A. Triantafyllidis, Dimitrios Tzovaras, Mic...
INFOCOM
2010
IEEE
13 years 7 months ago
Value-aware Resource Allocation for Service Guarantees in Networks
—The traditional formulation of the total value of information transfer is a multi-commodity flow problem. Here, each data source is seen as generating a commodity along a fixe...
Parimal Parag, Srinivas Shakkottai, Jean-Fran&cced...
IPPS
2010
IEEE
13 years 6 months ago
Executing task graphs using work-stealing
Abstract--NABBIT is a work-stealing library for execution of task graphs with arbitrary dependencies which is implemented as a library for the multithreaded programming language Ci...
Kunal Agrawal, Charles E. Leiserson, Jim Sukha
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
13 years 6 months ago
Efficient Planning in Large POMDPs through Policy Graph Based Factorized Approximations
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
Joni Pajarinen, Jaakko Peltonen, Ari Hottinen, Mik...