27692 search results - page 256 / 5539 » Where is ... |
102
Voted
CORR
2008
Springer
15 years 23 days ago
2008
Springer
Graph kernels methods are based on an implicit embedding of graphs within a vector space of large dimension. This implicit embedding allows to apply to graphs methods which where u...
116
click to vote
CORR
2008
Springer
15 years 23 days ago
2008
Springer
For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...
76
Voted
CORR
2008
Springer
15 years 23 days ago
2008
Springer
For wireless networks with multiple sources, an omnidirectional relay scheme is developed, where each node can help relay multiple messages in different directions. This is accomp...
102
Voted
ECCC
2010
15 years 23 days ago
2010
The parallel repetition theorem states that for any Two Prover Game with value at most 1 - (for < 1/2), the value of the game repeated n times in parallel is at most (1 - 3 )(n...
75
Voted
DM
2008
15 years 23 days ago
2008
Let {Bn(x)} be the Bernoulli polynomials. In the paper we establish some congruences for Bj(x) (mod pn), where p is an odd prime and x is a rational p-integer. Such congruences are...