Sciweavers

8486 search results - page 298 / 1698
» Ordered Enumeration Method
Sort
View
310
Voted
SIGMOD
2008
ACM
215views Database» more  SIGMOD 2008»
16 years 4 months ago
CSV: visualizing and mining cohesive subgraphs
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
Nan Wang, Srinivasan Parthasarathy, Kian-Lee Tan, ...
PPOPP
2010
ACM
16 years 1 months ago
GAMBIT: effective unit testing for concurrency libraries
As concurrent programming becomes prevalent, software providers are investing in concurrency libraries to improve programmer productivity. Concurrency libraries improve productivi...
Katherine E. Coons, Sebastian Burckhardt, Madanlal...
134
Voted
CCS
2005
ACM
15 years 10 months ago
Fast dictionary attacks on passwords using time-space tradeoff
Human-memorable passwords are a mainstay of computer security. To decrease vulnerability of passwords to bruteforce dictionary attacks, many organizations enforce complicated pass...
Arvind Narayanan, Vitaly Shmatikov
SMA
2003
ACM
163views Solid Modeling» more  SMA 2003»
15 years 9 months ago
Fast swept volume approximation of complex polyhedral models
We present an efficient algorithm to approximate the swept volume (SV) of a complex polyhedron along a given trajectory. Given the boundary description of the polyhedron and a pat...
Young J. Kim, Gokul Varadhan, Ming C. Lin, Dinesh ...
PLDI
2010
ACM
15 years 9 months ago
Line-up: a complete and automatic linearizability checker
Modular development of concurrent applications requires threadsafe components that behave correctly when called concurrently by multiple client threads. This paper focuses on line...
Sebastian Burckhardt, Chris Dern, Madanlal Musuvat...