430 search results - page 49 / 86 » A New Linearizing Restriction in the Pattern Matching Proble... |
CPM
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
WAOA
2004
Springer
14 years 1 months ago
2004
Springer
In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an...
NIPS
2008
13 years 9 months ago
2008
We consider multi-armed bandit problems where the number of arms is larger than the possible number of experiments. We make a stochastic assumption on the mean-reward of a new sel...
ICDCS
1998
IEEE
14 years 5 days ago
1998
IEEE
We address the problem of efficient circuit switching in wide area networks. The solution provided is based on finding optimal routes for lightpaths and semilightpaths. A lightpat...
CVPR
2006
IEEE
14 years 10 months ago
2006
IEEE
Multi-camera tracking systems often must maintain consistent identity labels of the targets across views to recover 3D trajectories and fully take advantage of the additional info...