Sciweavers

3792 search results - page 404 / 759
» Techniques for Trusted Software Engineering
Sort
View
211
Voted
FOSSACS
2008
Springer
15 years 8 months ago
Optimal Lower Bounds on Regular Expression Size Using Communication Complexity
The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2(n) in the worst case for ...
Hermann Gruber, Jan Johannsen
FECS
2008
123views Education» more  FECS 2008»
15 years 8 months ago
Transition from a Waterfall-Based Capstone Course to an Agile Model
We report on the successful process of transitioning a 4th-year university software engineering capstone course from a waterfall approach to an iterative, more agile model. The se...
Chris Lüer
AVI
2004
15 years 8 months ago
Using games to investigate movement for graph comprehension
We describe the results of empirical investigations that explore the effectiveness of moving graph diagrams to improve the comprehension of their structure. The investigations inv...
John Bovey, Florence Benoy, Peter Rodgers
AVI
2004
15 years 8 months ago
Quantum web fields and molecular meanderings: visualising web visitations
This paper describes two visualisation algorithms that give an impression of current activity on a web site. Both focus on giving a sense of the trail of individual visitors withi...
Geoffrey Ellis, Alan J. Dix
AVI
2004
15 years 8 months ago
Interactive data summarization: an example application
Summarizing large multidimensional datasets is a challenging task, often requiring extensive investigation by a user to identify overall trends and important exceptions to them. W...
Neal Lesh, Michael Mitzenmacher