Sciweavers

10890 search results - page 1702 / 2178
» Automatic Complexity Analysis
Sort
View
IEEEPACT
2006
IEEE
16 years 26 days ago
An empirical evaluation of chains of recurrences for array dependence testing
Code restructuring compilers rely heavily on program analysis techniques to automatically detect data dependences between program statements. Dependences between statement instanc...
Johnnie Birch, Robert A. van Engelen, Kyle A. Gall...
SIBGRAPI
2006
IEEE
16 years 25 days ago
Determining the branchings of 3D structures from respective 2D projections
This work describes a new framework for automatic extraction of 2D branching structures images obtained from 3D shapes, such as neurons and retinopathy images. The majority of met...
Jorge J. G. Leandro, Roberto M. Cesar, Luciano da ...
IMC
2006
ACM
16 years 24 days ago
Unexpected means of protocol inference
Network managers are inevitably called upon to associate network traffic with particular applications. Indeed, this operation is critical for a wide range of management functions...
Justin Ma, Kirill Levchenko, Christian Kreibich, S...
SOUPS
2006
ACM
16 years 24 days ago
Intentional access management: making access control usable for end-users
The usability of access control mechanisms in modern distributed systems has been widely criticized but little studied. In this paper, we carefully examine one such widely deploye...
Xiang Cao, Lee Iverson
185
Voted
UML
2005
Springer
16 years 9 days ago
Specifying Precise Use Cases with Use Case Charts
Use cases are a popular method for capturing and structuring software requirements. The informality of use cases is both a blessing and a curse. It enables easy application and lea...
Jon Whittle
« Prev « First page 1702 / 2178 Last » Next »