Sciweavers

2186 search results - page 328 / 438
» Considering an Organization's Memory
Sort
View
SIGMOD
2002
ACM
198views Database» more  SIGMOD 2002»
16 years 6 months ago
Processing complex aggregate queries over data streams
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...
ICFP
2008
ACM
16 years 6 months ago
Transactional events for ML
Transactional events (TE) are an approach to concurrent programming that enriches the first-class synchronous message-passing of Concurrent ML (CML) with a combinator that allows ...
Laura Effinger-Dean, Matthew Kehrt, Dan Grossman
CCS
2009
ACM
16 years 25 days ago
Robust signatures for kernel data structures
Kernel-mode rootkits hide objects such as processes and threads using a technique known as Direct Kernel Object Manipulation (DKOM). Many forensic analysis tools attempt to detect...
Brendan Dolan-Gavitt, Abhinav Srivastava, Patrick ...
IPPS
2009
IEEE
16 years 20 days ago
Dynamic iterations for the solution of ordinary differential equations on multicore processors
In the past few years, there has been a trend of providing increased computing power through greater number of cores on a chip, rather than through higher clock speeds. In order t...
Yanan Yu, Ashok Srinivasan
LICS
2009
IEEE
16 years 20 days ago
Qualitative Determinacy and Decidability of Stochastic Games with Signals
We consider the standard model of finite two-person zero-sum stochastic games with signals. We are interested in the existence of almost-surely winning or positively winning stra...
Nathalie Bertrand, Blaise Genest, Hugo Gimbert