125 search results - page 18 / 25 » ams 2000 |
SCHULE
2007
Springer
15 years 4 months ago
2007
Springer
: Trotz zahlreicher Gegenmaßnahmen hat die Informatik nach wie vor mit hohen Abbruchquoten und einem steigenden Desinteresse zu kämpfen. Wir vermuten, dass Wahlmotive sich in ein...
FSTTCS
2001
Springer
15 years 2 months ago
2001
Springer
Semidefinite programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain perf...
STOC
2000
ACM
15 years 2 months ago
2000
ACM
Abstract. We consider suffix tree construction for situations with missing suffix links. Two examples of such situations are suffix trees for parameterized strings and suffix trees...
ADBIS
2000
Springer
15 years 2 months ago
2000
Springer
We consider queries which originate from a mobile unit and whose result depends on the location of the user who initiates the query. Example of such a query is How many people are ...
COMBINATORICS
2000
14 years 9 months ago
2000
A graph with diameter d is strongly distance-regular if is distanceregular and its distance-d graph d is strongly regular. The known examples are all the connected strongly regu...