686 search results - page 55 / 138 » On the General Applicability of Instruction-Set Randomizatio... |
135
Voted
WIOPT
2010
IEEE
15 years 1 months ago
2010
IEEE
—It has been shown that the well-known cutset bounds can be achieved for deterministic wireless networks by performing random coding at each intermediate node. The complexity and...
202
Voted
TELSYS
2011
14 years 10 months ago
2011
GRASP (Greedy Randomized Adaptive Search Procedures) is a multistart metaheuristic for producing good-quality solutions of combinatorial optimization problems. Each GRASP iteration...
101
Voted
CVPR
2000
IEEE
16 years 5 months ago
2000
IEEE
Multi-resolution techniques have been used in a wide range of vision applications. Unfortunately, the costly operation of building a proper pyramid strongly reduces its value as a...
135
Voted
STOC
2003
ACM
16 years 3 months ago
2003
ACM
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our appro...
134
Voted
ICANN
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Many applications of machine learning involve sparse highdimensional data, where the number of input features is (much) larger than the number of data samples, d n. Predi...