5100 search results - page 995 / 1020 » The Linear Complexity of a Graph |
SIGMOD
2010
ACM
14 years 2 months ago
2010
ACM
Real-world databases often contain syntactic and semantic errors, in spite of integrity constraints and other safety measures incorporated into modern DBMSs. We present ERACER, an...
EUROCRYPT
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. Physical computational devices leak side-channel information that may, and often does, reveal secret internal states. We present a general transformation that compiles an...
ICALP
2010
Springer
14 years 2 months ago
2010
Springer
A discrete distribution D over Σ1 × · · · × Σn is called (non-uniform) k-wise independent if for any set of k indexes {i1, . . . , ik} and for any z1 ∈ Σi1 , . . . , zk ...
MMB
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
EUROPAR
2009
Springer
14 years 2 months ago
2009
Springer
Multicore architectures featuring specialized accelerators are getting an increasing amount of attention, and this success will probably influence the design of future High Perfor...