Sciweavers

492 search results - page 46 / 99
» The number of possibilities for random dating
Sort
View
STOC
2003
ACM
90views Algorithms» more  STOC 2003»
14 years 9 months ago
Work-competitive scheduling for cooperative computing with dynamic groups
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
Chryssis Georgiou, Alexander Russell, Alexander A....
BMCBI
2007
128views more  BMCBI 2007»
13 years 8 months ago
Model order selection for bio-molecular data clustering
Background: Cluster analysis has been widely applied for investigating structure in bio-molecular data. A drawback of most clustering algorithms is that they cannot automatically ...
Alberto Bertoni, Giorgio Valentini
IS
2010
13 years 7 months ago
Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
Wai Yin Mok, Joseph Fong, David W. Embley
SEMWEB
2007
Springer
14 years 2 months ago
Sampling and Soundness: Can We Have Both?
Recent research on model counting in CNF formulas has shown that a certain sampling method can yield results that are sound with a provably high probability. The key idea is to ite...
Carla P. Gomes, Jörg Hoffmann, Ashish Sabharw...
INFOCOM
2009
IEEE
14 years 3 months ago
Optimum Network Coding for Delay Sensitive Applications in WiMAX Unicast
—MAC layer random network coding (MRNC) was proposed in [1] as an alternative to HARQ for reliable data transmission in WiMAX unicast. It has been shown that MRNC achieves a high...
Amin Alamdar Yazdi, Sameh Sorour, Shahrokh Valaee,...