1722 search results - page 105 / 345 » On the sample mean of graphs |
147
click to vote
DCC
2002
IEEE
16 years 5 months ago
2002
IEEE
Let finite source and reproduction alphabets X and Y and a distortion measure d : X ? Y [0, ) be given. We study the minimum asymptotic rate required to describe a source distrib...
166
click to vote
CODES
2004
IEEE
15 years 10 months ago
2004
IEEE
This paper concerns automatic hardware synthesis from data flow graph (DFG) specification for fast HW/SW cosynthesis. A node in DFG represents a coarse grain block such as FIR and...
184
click to vote
COMBINATORICS
2000
15 years 6 months ago
2000
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...
190
click to vote
TCOS
2010
15 years 4 months ago
2010
We propose an approximation method to answer point-to-point shortest path queries in undirected edge-weighted graphs, based on random sampling and Voronoi duals. We compute a simp...
176
click to vote
CIVR
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. In this paper, we present a framework for segmenting the news programs into different story topics. The proposed method utilizes both visual and text information of the v...