1629 search results - page 87 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
TWC
2010
14 years 4 months ago
2010
We consider a frequency division multiplexed (FDM) system where each user employs a continuous phase modulation (CPM), serially concatenated with an outer code through an interleav...
110
click to vote
BMCBI
2008
14 years 10 months ago
2008
Background: Biomedical and chemical databases are large and rapidly growing in size. Graphs naturally model such kinds of data. To fully exploit the wealth of information in these...
PODS
2006
ACM
15 years 10 months ago
2006
ACM
d Abstract] Guizhen Yang Artificial Intelligence Center SRI International Menlo Park, CA 94025, USA Michael Kifer Dept. of Computer Science Stony Brook University Stony Brook, NY 1...
COCO
2009
Springer
15 years 4 months ago
2009
Springer
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...
PODS
2008
ACM
15 years 10 months ago
2008
ACM
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...