Sciweavers

14774 search results - page 2821 / 2955
» Computational complexity and evolutionary computation
Sort
View
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
16 years 5 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
ICALP
2009
Springer
16 years 4 months ago
Universal Succinct Representations of Trees?
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...
Arash Farzan, Rajeev Raman, S. Srinivasa Rao
VLDB
2007
ACM
155views Database» more  VLDB 2007»
16 years 4 months ago
Answering Aggregation Queries in a Secure System Model
As more sensitive data is captured in electronic form, security becomes more and more important. Data encryption is the main technique for achieving security. While in the past en...
Tingjian Ge, Stanley B. Zdonik
SIGMOD
2009
ACM
136views Database» more  SIGMOD 2009»
16 years 4 months ago
A comparison of approaches to large-scale data analysis
There is currently considerable enthusiasm around the MapReduce (MR) paradigm for large-scale data analysis [17]. Although the basic control flow of this framework has existed in ...
Andrew Pavlo, Erik Paulson, Alexander Rasin, Danie...
SIGMOD
2009
ACM
202views Database» more  SIGMOD 2009»
16 years 4 months ago
ZStream: a cost-based query processor for adaptively detecting composite events
Composite (or Complex) event processing (CEP) systems search sequences of incoming events for occurrences of userspecified event patterns. Recently, they have gained more attentio...
Yuan Mei, Samuel Madden
« Prev « First page 2821 / 2955 Last » Next »