Sciweavers

11211 search results - page 2144 / 2243
» Data Structures
Sort
View
POPL
1995
ACM
15 years 1 months ago
Total Correctness by Local Improvement in Program Transformation
The goal of program transformation is to improve efficiency while preserving meaning. One of the best known transformation techniques is Burstall and Darlington’s unfold-fold me...
David Sands
SIGSOFT
1995
ACM
15 years 1 months ago
Precise Interprocedural Chopping
The notion of a program slice, originally introduced by Mark Weiser, is a fundamental operation for addressing many software-engineering problems, including program understanding,...
Thomas W. Reps, Genevieve Rosay
91
Voted
ACMSE
2009
ACM
15 years 1 months ago
Using computer graphics to explore object oriented concepts using C
Most recent graphics courses are what we would call topdown courses. Courses that focus on using graphical packages to implement and teach graphics. The course discussed in this p...
William C. Kreahling
NSDI
2008
15 years 14 days ago
UsenetDHT: A Low-Overhead Design for Usenet
Usenet is a popular distributed messaging and file sharing service: servers in Usenet flood articles over an overlay network to fully replicate articles across all servers. Howeve...
Emil Sit, Robert Morris, M. Frans Kaashoek
BIRD
2008
Springer
162views Bioinformatics» more  BIRD 2008»
15 years 4 days ago
Suffix Tree Characterization of Maximal Motifs in Biological Sequences
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
Maria Federico, Nadia Pisanti
« Prev « First page 2144 / 2243 Last » Next »