2735 search results - page 45 / 547 » Comparing notions of randomness |
SIAMJO
2010
13 years 3 months ago
2010
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
FOCS
2008
IEEE
14 years 3 months ago
2008
IEEE
A plethora of random graph models have been developed in recent years to study a range of problems on networks, driven by the wide availability of data from many social, telecommu...
PKC
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Key-insulated cryptography is a crucial technique for protecting private keys. To strengthen the security of key-insulated protocols, Hanaoka, Hanaoka and Imai recently i...
COMPGEOM
2011
ACM
13 years 11 days ago
2011
ACM
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
ECCC
2000
13 years 8 months ago
2000
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...