534 search results - page 77 / 107 » Tight approximation algorithm for connectivity augmentation ... |
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...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
AISADM
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We present CoLe, a model for cooperative agents for mining knowledge from heterogeneous data. CoLe allows for the cooperation of different mining agents and the combinat...
INFOCOM
2003
IEEE
14 years 25 days ago
2003
IEEE
— There is a growing interest among service providers to offer new services with Quality of Service (QoS) guaranties that are also resilient to failures. Supporting QoS connectio...
FOCS
2002
IEEE
14 years 15 days ago
2002
IEEE
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....