551 search results - page 72 / 111 » The Complexity of Andersen's Analysis in Practice |
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
EUROSYS
2007
ACM
15 years 3 months ago
2007
ACM
As information technology (IT) administration becomes increasingly complex, workflow technologies are gaining popularity for IT automation. Writing correct workflow programs is no...
SOUPS
2010
ACM
15 years 3 months ago
2010
ACM
Text-based passwords are still the most commonly used authentication mechanism in information systems. We took advantage of a unique opportunity presented by a significant change...
CAV
2010
Springer
15 years 3 months ago
2010
Springer
We consider the class of finite-state programs executed by an unbounded number of replicated threads communicating via shared variables. The thread-state reachability problem for t...
USS
2008
15 years 2 months ago
2008
The State of Ohio commissioned the EVEREST study in late summer of 2007. The study participants were charged with an analysis of the usability, stability, and security of all voti...