101
click to vote
CJTCS
2016
10 years 15 days 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...
190
click to vote
CJTCS
2016
10 years 15 days 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...
172
click to vote
CJ
2016
10 years 15 days 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...
184
click to vote
CIM
2016
10 years 15 days 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...
CHB
2016
10 years 15 days ago
2016
Lacking the presence of human and social elements is claimed one major weakness that is hindering the growth of e-commerce. The emergence of social commerce (SC) might help amelio...
CHB
2016
10 years 15 days ago
2016
:
Despite
increasing
public
interest
and
concern
about
young
people’s
involvement
in
the
self-‐production
of
sexu...
CGO
2016
IEEE
10 years 16 days ago
2016
IEEE
CGO
2016
IEEE
10 years 16 days ago
2016
IEEE
After a software system is compromised, it can be difficult to understand what vulnerabilities attackers exploited. Any information residing on that machine cannot be trusted as ...
101
click to vote
CGO
2016
IEEE
10 years 16 days ago
2016
IEEE
A program subject to a Return-Oriented Programming (ROP) attack usually presents an execution trace with a high frequency of indirect branches. From this observation, several rese...