11381 search results - page 1901 / 2277 » Connectivity |
190
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Wigderson and Xiao presented an efficient derandomization of the matrix Chernoff bound using the method of pessimistic estimators [WX08]. Building on their construction, we prese...
161
click to vote
COGSR
2010
15 years 1 months ago
2010
We propose a formalization of C.G. Jung's theory of personality using a four-dimensional Hilbert-space for the representation of two qubits. The first qubit relates to Jung&#...
172
click to vote
COLING
2010
15 years 1 months ago
2010
Humans are very good at judging the strength of relationships between two terms, a task which, if it can be automated, would be useful in a range of applications. Systems attempti...
303
click to vote
DISOPT
2011
15 years 1 months ago
2011
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...
227
click to vote
ECCC
2011
15 years 1 months ago
2011
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...