411 search results - page 66 / 83 » Efficient View Maintenance Using Version Numbers |
CORR
2008
Springer
13 years 11 months ago
2008
Springer
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...
ECAL
1995
Springer
14 years 2 months ago
1995
Springer
After an outline of the history of evolutionary algorithms, a new ( ) variant of the evolution strategies is introduced formally. Though not comprising all degrees of freedom, it i...
SIROCCO
2000
14 years 7 days ago
2000
ABSTRACT: This work considers the problem of performing a set of N tasks on a set of P cooperating message-passing processors (P N). The processors use a group communication servi...
TASLP
2002
13 years 10 months ago
2002
The first stage in many pattern recognition tasks is to generate a good set of features from the observed data. Usually, only a single feature space is used. However, in some compl...
CVPR
2007
IEEE
15 years 28 days ago
2007
IEEE
One of the hard problems in automated sign language recognition is the movement epenthesis (me) problem. Movement epenthesis is the gesture movement that bridges two consecutive s...