608 search results - page 108 / 122 » On Dependent Randomized Rounding Algorithms |
JSAC
2007
13 years 7 months ago
2007
— To achieve high performance and resilience to failures, a client can make connections with multiple servers simultaneously and receive different portions of the data from each ...
RSA
2008
13 years 7 months ago
2008
For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...
IEEECIT
2010
IEEE
13 years 6 months ago
2010
IEEE
This paper investigates the energy-saving organization of sensor nodes in large wireless sensor networks. Due to a random deployment used in many application scenarios, much more n...
IJON
2010
13 years 6 months ago
2010
We introduce a new causal hierarchical belief network for image segmentation. Contrary to classical tree structured (or pyramidal) models, the factor graph of the network contains...
PE
2010
Springer
13 years 6 months ago
2010
Springer
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...