Sciweavers

1089 search results - page 180 / 218
» Bounds on generalized Frobenius numbers
Sort
View
CORR
2008
Springer
128views Education» more  CORR 2008»
13 years 9 months ago
A Fast Generic Sequence Matching Algorithm
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...
David R. Musser, Gor V. Nishanov
CORR
2006
Springer
129views Education» more  CORR 2006»
13 years 8 months ago
On the Optimality of the ARQ-DDF Protocol
The performance of the automatic repeat request-dynamic decode and forward (ARQ-DDF) cooperation protocol is analyzed in two distinct scenarios. The first scenario is the multiple...
Kambiz Azarian, Hesham El Gamal, Philip Schniter
INFOCOM
2012
IEEE
11 years 11 months ago
Combinatorial auction with time-frequency flexibility in cognitive radio networks
—In this paper, we tackle the spectrum allocation problem in cognitive radio (CR) networks with time-frequency flexibility consideration using combinatorial auction. Different f...
Mo Dong, Gaofei Sun, Xinbing Wang, Qian Zhang
ECCV
2004
Springer
14 years 10 months ago
Accuracy of Spherical Harmonic Approximations for Images of Lambertian Objects under Far and Near Lighting
Various problems in Computer Vision become difficult due to a strong influence of lighting on the images of an object. Recent work showed analytically that the set of all images of...
Darya Frolova, Denis Simakov, Ronen Basri
ICPR
2008
IEEE
14 years 10 months ago
Solving quadratically constrained geometrical problems using lagrangian duality
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
Carl Olsson, Anders Eriksson