686 search results - page 48 / 138 » On the General Applicability of Instruction-Set Randomizatio... |
174
Voted
COCOA
2008
Springer
15 years 5 months ago
2008
Springer
We introduce a new combinatorial optimization problem, which is a generalization of the Traveling Salesman Problem (TSP) and which we call Traveling Salesman Problem of Second Orde...
118
click to vote
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
199
Voted
PAMI
2010
15 years 1 months ago
2010
The notion of using context information for solving high-level vision and medical image segmentation problems has been increasingly realized in the field. However, how to learn a...
165
Voted
ICST
2008
IEEE
15 years 10 months ago
2008
IEEE
Web applications have rapidly become a critical part of business for many organizations. However, increased usage of web applications has not been reciprocated with corresponding ...
147
Voted
HPDC
2008
IEEE
15 years 3 months ago
2008
IEEE
Basic data flow patterns which we call idioms, such as stream, transpose, reduction, random access and stencil, are common in scientific numerical applications. We hypothesize tha...