2520 search results - page 387 / 504 » The complexity of approximating entropy |
120
click to vote
CVPR
2010
IEEE
16 years 3 days ago
2010
IEEE
We present an efficient pixel-sampling technique for histogram-based search. Given a template image as a query, a typical histogram-based algorithm aims to find the location of ...
136
click to vote
WWW
2010
ACM
15 years 11 months ago
2010
ACM
We propose a novel method, based on concepts from expander graphs, to sample communities in networks. We show that our sampling method, unlike previous techniques, produces subgra...
133
click to vote
KDD
2009
ACM
15 years 11 months ago
2009
ACM
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
134
click to vote
GLOBECOM
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract – This paper considers a design of signal constellations for trans-modulation (constellation rearrangement: CoRe) in a relay system with the multiple links in which the ...
138
click to vote
ICASSP
2009
IEEE
15 years 11 months ago
2009
IEEE
In the last few years, we have witnessed an explosion in applications of sparse representation, the majority of which share the need for finding sparse solutions of underdetermine...