76 search results - page 6 / 16 » Random Edge Can Be Exponential on Abstract Cubes |
DAGM
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Approximations based on random Fourier features have recently emerged as an efficient and elegant methodology for designing large-scale kernel machines [4]. By expressing...
COMBINATORICA
2007
14 years 9 months ago
2007
The standard Erd˝os-Renyi model of random graphs begins with n isolated vertices, and at each round a random edge is added. Parametrizing n 2 rounds as one time unit, a phase tra...
CPM
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. The input to the Shortest Common Superstring (SCS) problem is a set S of k words of total length n. In the classical version the output is an explicit word SCS(S) in whic...
95
Voted
CAIP
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. In this paper we address the challenging problem of recovering the depth of a scene from a single image using defocus cue. To achieve this, we first present a novel appro...
WALCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...