1816 search results - page 112 / 364 » Trace oblivious computation |
TCS
2002
13 years 10 months ago
2002
Oblivious permutation routing in binary d-cubes has been well studied in the literature. In a permutation routing, each node initially contains a packet with a destination such th...
PVLDB
2010
13 years 8 months ago
2010
Users of text search engines are increasingly wary that their activities may disclose confidential information about their business or personal profiles. It would be desirable f...
SIGGRAPH
1995
ACM
14 years 1 months ago
1995
ACM
Most recent rendering research has concentrated on two subproblems: modeling the reflection of light from materials, and calculating the direct and indirect illumination from lig...
CLOUD
2010
ACM
14 years 3 months ago
2010
ACM
Batched stream processing is a new distributed data processing paradigm that models recurring batch computations on incrementally bulk-appended data streams. The model is inspired...
OPODIS
2003
13 years 11 months ago
2003
Detecting whether a finite execution trace (or a computation) of a distributed program satisfies a given predicate, called predicate detection, is a fundamental problem in distr...