15254 search results - page 4 / 3051 » A k |
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
62
Voted
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—In this paper, we study the problem of constructing full-coverage three dimensional networks with multiple connectivity. We design a set of patterns for full coverage and two re...
SWAT
2004
Springer
15 years 2 months ago
2004
Springer
The standard dynamic programming solution to finding k-medians on a line with n nodes requires O(kn2 ) time. Dynamic programming speedup techniques, e.g., use of the quadrangle i...
COCO
2003
Springer
15 years 2 months ago
2003
Springer
SACRYPT
2001
Springer
15 years 2 months ago
2001
Springer
![Fast Generation of Pairs (k, [k]P) for Koblitz Elliptic Curves](https://www.sciweavers.org/files/imagecache/thumbnail/imagecache/fast_generation_of_pairs_k_k_p_for_koblitz_elliptic_curves_SACRYPT_2001.jpg "Fast Generation of Pairs (k, [k]P) for Koblitz Elliptic Curves")