1046 search results - page 99 / 210 » Approximation Algorithms for Domination Search |
111
click to vote
ICIP
2006
IEEE
16 years 4 months ago
2006
IEEE
For the first time, we compute modulation domain features for infrared targets and backgrounds, including dominant modulations that characterize the local texture contrast, orient...
125
click to vote
VTC
2010
IEEE
15 years 1 months ago
2010
IEEE
—A common simplification in the treatment of random linear channels is the wide-sense stationary and uncorrelated scattering (WSSUS) assumption. For wireless channels, this assu...
117
click to vote
MM
2009
ACM
15 years 9 months ago
2009
ACM
This paper proposes a hash function family based on feature vocabularies and investigates the application in building indexes for image search. Each hash function is associated wi...
139
click to vote
WINE
2007
Springer
15 years 9 months ago
2007
Springer
Internet search companies sell advertisement slots based on users’ search queries via an auction. Advertisers have to solve a complex optimization problem of how to place bids o...
133
click to vote
ALGORITHMICA
2010
15 years 3 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...