2095 search results - page 400 / 419 » Improved pebbling bounds |
FOCS
2002
IEEE
14 years 2 months ago
2002
IEEE
Two decades ago, Megiddo and Dyer showed that linear programming in two and three dimensions (and subsequently any constant number of dimensions) can be solved in linear time. In ...
SIGMOD
2010
ACM
14 years 2 months ago
2010
ACM
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
KR
2010
Springer
14 years 2 months ago
2010
Springer
Horn fragments of Description Logics (DLs) have gained popularity because they provide a beneficial trade-off between expressive power and computational complexity and, more spec...
CRYPTO
2001
Springer
14 years 2 months ago
2001
Springer
We deal with the problem of a center sending a message to a group of users such that some subset of the users is considered revoked and should not be able to obtain the content of...
EMSOFT
2001
Springer
14 years 2 months ago
2001
Springer
Abstract This paper is sort of a confession. Issues of synchrony, asynchrony, and synchronization, arise frequently in designing embedded systems from components, like everyone I k...