2060 search results - page 301 / 412 » Some Applications of Coding Theory in Computational Complexi... |
129
click to vote
FOCS
2004
IEEE
15 years 8 months ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
167
click to vote
BRAIN
2010
Springer
15 years 5 months ago
2010
Springer
Cognitive informatics studies the natural intelligence and the brain from a theoretical and a computational approach, which rigorously explains the ms of the brain by a fundamental...
230
click to vote
ICDE
2008
IEEE
16 years 5 months ago
2008
IEEE
We consider a privacy threat to a social network in which the goal of an attacker is to obtain knowledge of a significant fraction of the links in the network. We formalize the ty...
132
click to vote
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
Topological persistence has proven to be a key concept for the study of real-valued functions defined over topological spaces. Its validity relies on the fundamental property tha...
124
click to vote
WMPI
2004
ACM
15 years 9 months ago
2004
ACM
Clustered microarchitectures are an effective organization to deal with the problem of wire delays and complexity by partitioning some of the processor resources. The organization ...