Sciweavers

24188 search results - page 4538 / 4838
» Computing on Encrypted Data
Sort
View
234
Voted
RECOMB
2001
Springer
16 years 7 months ago
Finding motifs using random projections
motif discovery problem abstracts the task of discovering short, conserved sites in genomic DNA. Pevzner and Sze recently described a precise combinatorial formulation of motif di...
Jeremy Buhler, Martin Tompa
SIGMOD
2009
ACM
157views Database» more  SIGMOD 2009»
16 years 6 months ago
FPGA: what's in it for a database?
While there seems to be a general agreement that next years' systems will include many processing cores, it is often overlooked that these systems will also include an increa...
Jens Teubner, René Müller
SIGMOD
2004
ACM
126views Database» more  SIGMOD 2004»
16 years 6 months ago
Indexing Spatio-Temporal Trajectories with Chebyshev Polynomials
In this paper, we attempt to approximate and index a ddimensional (d 1) spatio-temporal trajectory with a low order continuous polynomial. There are many possible ways to choose ...
Yuhan Cai, Raymond T. Ng
PODS
2008
ACM
178views Database» more  PODS 2008»
16 years 6 months ago
The chase revisited
We revisit the classical chase procedure, studying its properties as well as its applicability to standard database problems. We settle (in the negative) the open problem of decid...
Alin Deutsch, Alan Nash, Jeffrey B. Remmel
ICFP
2002
ACM
16 years 6 months ago
Meta-programming with names and necessity
Meta-programming is a discipline of writing programs in a certain programming language that generate, manipulate or execute programs written in another language. In a typed settin...
Aleksandar Nanevski
« Prev « First page 4538 / 4838 Last » Next »