17129 search results - page 3133 / 3426 » Applied Computing |
343
click to vote
DIMACS
1996
15 years 8 months ago
1996
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
147
click to vote
CHI
2003
ACM
16 years 7 months ago
2003
ACM
In the past, most early hands-on users of interactive software in organizations were individual contributors. Managers as early adopters is a new trend with significant implicatio...
153
click to vote
CCS
2001
ACM
15 years 10 months ago
2001
ACM
We present a mathematical construct which provides a cryptographic protocol to verifiably shuffle a sequence of k modular integers, and discuss its application to secure, universa...
191
click to vote
CGO
2004
IEEE
15 years 10 months ago
2004
IEEE
In this paper, we describe a generalized approach to deriving a custom data layout in multiple memory banks for array-based computations, to facilitate high-bandwidth parallel mem...
260
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...