612 search results - page 116 / 123 » Hardness assumptions in the foundations of theoretical compu... |
157
click to vote
ISER
1995
Springer
15 years 10 months ago
1995
Springer
Minimalism pursues the following agenda: For a given robotics task, nd the minimal con guration of resources required to solve the task. Thus, minimalism attempts to reduce the re...
178
click to vote
FOCS
2007
IEEE
16 years 1 months ago
2007
IEEE
We design a randomized polynomial time algorithm which, given a 3-tensor of real numbers A = {aijk}n i,j,k=1 such that for all i, j, k ∈ {1, . . . , n} we have ai jk = aik j = a...
169
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
179
click to vote
ICS
2007
Tsinghua U.
16 years 26 days ago
2007
Tsinghua U.
Sensitivity Analysis (SA) is a novel compiler technique that complements, and integrates with, static automatic parallelization analysis for the cases when relevant program behavi...
186
click to vote
ACSC
2006
IEEE
16 years 24 days ago
2006
IEEE
Malware — a generic term that encompasses viruses, trojans, spywares and other intrusive code — is widespread today. Malware analysis is a multi-step process providing insight...