Sciweavers

3946 search results - page 502 / 790
» The computational complexity of choice sets
Sort
View

Publication
264views
15 years 3 months ago
Combined feature evaluation for adaptive visual object tracking
Existing visual tracking methods are challenged by object and background appearance variations, which often occur in a long duration tracking. In this paper, we propose a combined ...
Zhenjun Han, Qixiang Ye, Jianbin Jiao
HEURISTICS
2010
15 years 1 months ago
A large neighbourhood search approach to the multi-activity shift scheduling problem
The challenge in shift scheduling lies in the construction of a set of work shifts, which are subject to specific regulations, in order to cover fluctuating staff demands. This pro...
Claude-Guy Quimper, Louis-Martin Rousseau
IWOCA
2010
Springer
219views Algorithms» more  IWOCA 2010»
15 years 1 months ago
Efficient Chaining of Seeds in Ordered Trees
We consider here the problem of chaining seeds in ordered trees. Seeds are mappings between two trees Q and T and a chain is a subset of non overlapping seeds that is consistent wi...
Julien Allali, Cedric Chauve, Pascal Ferraro, Anne...
TSP
2010
15 years 1 months ago
Dynamic spectrum management with the competitive market model
[1, 2] have shown for the dynamic spectrum allocation problem that a competitive market model (which sets a price for transmission power on each channel) leads to a greater social...
Yao Xie, Benjamin Armbruster, Yinyu Ye
ICASSP
2011
IEEE
14 years 10 months ago
Improving the performance of DSP systems for MIMO processing
While the research into MIMO communications algorithms have reached levels of development that show important wireless systems performance improvements, the development of DSP sys...
Nathaniel Horner, Andres Kwasinski, Antonio Mondra...