1068 search results - page 195 / 214 » For completeness, sublogarithmic space is no space |
STOC
2010
ACM
14 years 10 days ago
2010
ACM
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
SIGMOD
2010
ACM
14 years 9 days ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
SIGMOD
2010
ACM
14 years 9 days ago
2010
ACM
Fast query processing of complex objects, e.g. spatial or uncertain objects, depends on efficient spatial pruning of the objects’ approximations, which are typically minimum bou...
EUROCRYPT
2010
Springer
14 years 9 days ago
2010
Springer
Imagine many small devices send data to a single receiver, encrypted using the receiver’s public key. Assume an adversary that has the power to adaptively corrupt a subset of the...
IWMM
2010
Springer
14 years 8 days ago
2010
Springer
Temporal memory safety errors, such as dangling pointer dereferences and double frees, are a prevalent source of software bugs in unmanaged languages such as C. Existing schemes t...