1814 search results - page 136 / 363 » Improved Results on Geometric Hitting Set Problems |
168
click to vote
ICIP
2009
IEEE
16 years 7 months ago
2009
IEEE
This paper presents a new approach to solve the problem of quality degradation of a synthesized view, when a virtual camera moves forward. Interpolation techniques using only two ...
136
click to vote
CSR
2006
Springer
15 years 10 months ago
2006
Springer
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, w...
150
click to vote
JDA
2008
15 years 6 months ago
2008
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, ...
202
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract— Cooperative relay networks combined with Orthogonal Frequency Division Multiplexing Access (OFDMA) technology has been widely recognized as a promising candidate for fu...
155
click to vote
INFORMS
2000
15 years 6 months ago
2000
We develop a variant of the Nelder-Mead (NM) simplex search procedure for stochastic simulation optimization that is designed to avoid many of the weaknesses encumbering such dire...