109
Voted
CJTCS
2016
10 years 1 months ago
2016
112
Voted
CJTCS
2016
10 years 1 months ago
2016
: In a recent result, Khot and Saket [FOCS 2014] proved the quasi-NP-hardness of coloring a 2-colorable 12-uniform hypergraph with 2(logn)Ω(1) colors. This result was proved usin...
208
Voted
CJTCS
2016
10 years 1 months ago
2016
Abstract: Bourgain and Yehudayoff recently constructed O(1)-monotone bipartite expanders. By combining this result with a generalisation of the unraveling method of Kannan, we cons...
188
Voted
CJ
2016
10 years 1 months ago
2016
Abstract. The minimum spanning tree (MST) construction is a classical problem in Distributed Computing for creating a globally minimized structure distributedly. Self-stabilization...
200
Voted
CIM
2016
10 years 1 months ago
2016
One of the challenges of using brain-computer interfaces (BCIs) over extended periods of time is the variation of the users’ performance from one experimental day to another. The...