Sciweavers

21324 search results - page 3937 / 4265
» Making the case for computing
Sort
View
DAC
2011
ACM
14 years 3 months ago
Extracting behavior and dynamically generated hierarchy from SystemC models
SystemC is a popular modeling language which can be used to specify systems at bstraction level. Currently, SystemC tools can not cope with SystemC models for which the module hie...
Harry Broeders, René van Leuken
DC
2011
14 years 3 months ago
Distributed algorithms for covering, packing and maximum weighted matching
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
Christos Koufogiannakis, Neal E. Young
DCOSS
2011
Springer
14 years 3 months ago
On sensor selection in linked information networks
—Sensor networks are often redundant by design; this is often done in order to achieve reliability in information processing. In many cases, the redundancy relationships between ...
Charu C. Aggarwal, Amotz Bar-Noy, Simon Shamoun
ICDCS
2011
IEEE
14 years 3 months ago
Delay-Cognizant Reliable Delivery for Publish/Subscribe Overlay Networks
—The number of real-world applications that require QoS guarantees is constantly increasing and they often follow the publish/subscribe (pub/sub) messaging paradigm, which provid...
Shuo Guo, Kyriakos Karenos, Minkyong Kim, Hui Lei,...
CORR
2012
Springer
170views Education» more  CORR 2012»
13 years 11 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
« Prev « First page 3937 / 4265 Last » Next »