1760 search results - page 219 / 352 » Connected Set Cover Problem and Its Applications |
PODC
2009
ACM
14 years 8 months ago
2009
ACM
Global consistency or Byzantine Agreement (BA) and reliable point-to-point communication are two of the most important and well-studied problems in distributed computing. Informal...
CSB
2003
IEEE
14 years 1 months ago
2003
IEEE
Reverse-engineering of gene networks using linear models often results in an underdetermined system because of excessive unknown parameters. In addition, the practical utility of ...
CRYPTO
2006
Springer
13 years 11 months ago
2006
Springer
Abstract Lattice reduction is a hard problem of interest to both publickey cryptography and cryptanalysis. Despite its importance, extremely few algorithms are known. The best algo...
CIKM
2008
Springer
13 years 10 months ago
2008
Springer
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Searching for optimal ways in a network is an important task in multiple application areas such as social networks, co-citation graphs or road networks. In the majority of applicat...