Sciweavers

12753 search results - page 2548 / 2551
» is 2002
Sort
View
STOC
2002
ACM
144views Algorithms» more  STOC 2002»
14 years 7 months ago
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...
Surender Baswana, Ramesh Hariharan, Sandeep Sen
GI
2004
Springer
14 years 26 days ago
Extreme Programming in der Informatik-Lehre - Ein Erfahrungsbericht
: eXtreme Programming (XP) ist eine Symbiose verschiedener Techniken, die erst durch ihr Zusammenwirken ihre besondere Qualit¨at agiler Softwareentwicklung aufweisen. Sie lassen s...
Holger Mügge, Daniel Speicher, Günter Kn...
SIGUCCS
2003
ACM
14 years 22 days ago
WebDAV: what it is, what it does, why you need it
Legacy network file services such as NFS, SMB/CIFS, and AFP changed the way we worked. File services running on crossplatform networks allowed us to save our files on remote syste...
Luis O. Hernández, Mahmoud Pegah
BTW
2003
Springer
99views Database» more  BTW 2003»
14 years 22 days ago
Von digitalen Bibliotheken zu Online-Shops mit digitalen Produkten
: Digitale Bibliotheken lassen sich als organisierte Sammlungen digitaler (multimedialer) Dokumente charakterisieren. Sie erm¨oglichen Anbietern die Verwaltung und Konsumenten den...
Dietrich Boles
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
14 years 21 days ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
« Prev « First page 2548 / 2551 Last » Next »