Zobrazeno 1 - 10
of 1 142
pro vyhledávání: '"Space-Time tradeoffs"'
In this paper, we investigate space-time tradeoffs for answering conjunctive queries with access patterns (CQAPs). The goal is to create a space-efficient data structure in an initial preprocessing phase and use it for answering (multiple) queries in
Externí odkaz:
http://arxiv.org/abs/2304.06221
Autor:
Gavranović, Bruno
Optics and lenses are abstract categorical gadgets that model systems with bidirectional data flow. In this paper we observe that the denotational definition of optics - identifying two optics as equivalent by observing their behaviour from the outsi
Externí odkaz:
http://arxiv.org/abs/2209.09351
In this paper, we investigate space-time tradeoffs for answering Boolean conjunctive queries. The goal is to create a data structure in an initial preprocessing phase and use it for answering (multiple) queries. Previous work has developed data struc
Externí odkaz:
http://arxiv.org/abs/2109.10889
Autor:
ARYA, SUNIL1 arya@cse.ust.hk, MALAMATOS, THEOCHARIS2 tmalamat@uop.gr, MOUNT, DAVID M.3 mount@cs.umd.edu
Publikováno v:
Journal of the ACM. Nov2009, Vol. 57 Issue 1, p1-1:54. 54p. 25 Diagrams.
In the kSUM problem we are given an array of numbers $a_1,a_2,...,a_n$ and we are required to determine if there are $k$ different elements in this array such that their sum is 0. This problem is a parameterized version of the well-studied SUBSET-SUM
Externí odkaz:
http://arxiv.org/abs/1807.03718
Pebble games were originally formulated to study time-space tradeoffs in computation, modeled by games played on directed acyclic graphs (DAGs). Close connections between pebbling and cryptography have been known for decades. A series of recent resea
Externí odkaz:
http://arxiv.org/abs/1802.07433
In recent years much effort has been concentrated towards achieving polynomial time lower bounds on algorithms for solving various well-known problems. A useful technique for showing such lower bounds is to prove them conditionally based on well-stud
Externí odkaz:
http://arxiv.org/abs/1706.05847
Autor:
Christiani, Tobias
We present a framework for similarity search based on Locality-Sensitive Filtering (LSF), generalizing the Indyk-Motwani (STOC 1998) Locality-Sensitive Hashing (LSH) framework to support space-time tradeoffs. Given a family of filters, defined as a d
Externí odkaz:
http://arxiv.org/abs/1605.02687
Verifying that a network configuration satisfies a given boolean predicate is a fundamental problem in distributed computing. Many variations of this problem have been studied, for example, in the context of proof labeling schemes (PLS), locally chec
Externí odkaz:
http://arxiv.org/abs/1605.06814
Publikováno v:
Journal of Avian Biology, 2015 Nov 01. 46(6), 658-667.
Externí odkaz:
https://www.jstor.org/stable/javianbiology.46.6.658