851 search results - page 76 / 171 » Random constructions and density results |
98
Voted
SODA
2012
ACM
13 years 22 days ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
87
Voted
ECCC
2006
14 years 10 months ago
2006
We give new constructions of randomness extractors and lossless condensers that are optimal to within constant factors in both the seed length and the output length. For extractor...
ICIP
2003
IEEE
15 years 12 months ago
2003
IEEE
In this paper, we rely on the theory of marked point processes to perform an unsupervised road network extraction from optical and radar images. A road network is modeled by a Mar...
82
Voted
ICIP
2009
IEEE
15 years 11 months ago
2009
IEEE
A direct approach for parametric estimation of 2D affine deformations between compound shapes is proposed. It provides the result as a least-square solution of a linear system of ...
ICASSP
2009
IEEE
15 years 5 months ago
2009
IEEE
This paper extends our previous work on feature transformationbased support vector machines for speaker recognition by proposing a joint MAP adaptation of feature transformation (...