Sciweavers

3341 search results - page 624 / 669
» On Bounded Queries and Approximation
Sort
View
COCO
2010
Springer
186views Algorithms» more  COCO 2010»
15 years 1 months ago
Derandomized Parallel Repetition of Structured PCPs
A PCP is a proof system for NP in which the proof can be checked by a probabilistic verifier. The verifier is only allowed to read a very small portion of the proof, and in return ...
Irit Dinur, Or Meir
DBA
2006
236views Database» more  DBA 2006»
14 years 11 months ago
Quantizing Time Series for Efficient Subsequence Matching
Indexing time series data is an interesting problem that has attracted much interest in the research community for the last decade. Traditional indexing methods organize the data ...
Inés Fernando Vega López, Bongki Moo...
SODA
2004
ACM
121views Algorithms» more  SODA 2004»
14 years 11 months ago
A characterization of easily testable induced subgraphs
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
Noga Alon, Asaf Shapira
JCST
2007
151views more  JCST 2007»
14 years 9 months ago
Indexing Future Trajectories of Moving Objects in a Constrained Network
Abstract Advances in wireless sensor networks and positioning technologies enable new applications monitoring moving objects. Some of these applications, such as traffic managemen...
Ji-Dong Chen, Xiao-Feng Meng
IACR
2011
106views more  IACR 2011»
13 years 9 months ago
Hash Functions Based on Three Permutations: A Generic Security Analysis
We consider the family of 2n-to-n-bit compression functions that are solely based on at most three permutation executions and on XOR-operators, and analyze its collision and preima...
Bart Mennink, Bart Preneel