2060 search results - page 42 / 412 » Some Applications of Coding Theory in Computational Complexi... |
ICDM
2009
IEEE
14 years 7 months ago
2009
IEEE
The design of a good kernel is fundamental for knowledge discovery from graph-structured data. Existing graph kernels exploit only limited information about the graph structures bu...
SIGECOM
2005
ACM
15 years 3 months ago
2005
ACM
We determine the communication complexity of the common voting rules. The rules (sorted by their communication complexity from low to high) are plurality, plurality with runoff, ...
102
click to vote
COCO
2011
Springer
13 years 9 months ago
2011
Springer
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
110
click to vote
DCG
2011
14 years 4 months ago
2011
We study the expected topological properties of ˇCech and Vietoris-Rips complexes built on random points in Rd . We find higher dimensional analogues of known results for connect...
113
click to vote
HICSS
2010
IEEE
15 years 4 months ago
2010
IEEE
Network security is a complex and challenging problem. The area of network defense mechanism design is receiving immense attention from the research community for more than two de...