Sciweavers

20059 search results - page 3757 / 4012
» The Satellite Data Model
Sort
View
RECOMB
2006
Springer
16 years 1 months ago
Efficient Enumeration of Phylogenetically Informative Substrings
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
Stanislav Angelov, Boulos Harb, Sampath Kannan, Sa...
STOC
2005
ACM
150views Algorithms» more  STOC 2005»
16 years 1 months ago
Correcting errors without leaking partial information
This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak ...
Yevgeniy Dodis, Adam Smith
SIGMOD
2007
ACM
145views Database» more  SIGMOD 2007»
16 years 1 months ago
Why off-the-shelf RDBMSs are better at XPath than you might expect
To compensate for the inherent impedance mismatch between the relational data model (tables of tuples) and XML (ordered, unranked trees), tree join algorithms have become the prev...
Torsten Grust, Jan Rittinger, Jens Teubner
SIGMOD
2007
ACM
153views Database» more  SIGMOD 2007»
16 years 1 months ago
Scaling games to epic proportion
We introduce scalability for computer games as the next frontier for techniques from data management. A very important aspect of computer games is the artificial intelligence (AI)...
Walker M. White, Alan J. Demers, Christoph Koch, J...
PODS
2002
ACM
167views Database» more  PODS 2002»
16 years 1 months ago
OLAP Dimension Constraints
In multidimensional data models intended for online analytic processing (OLAP), data are viewed as points in a multidimensional space. Each dimension has structure, described by a...
Carlos A. Hurtado, Alberto O. Mendelzon
« Prev « First page 3757 / 4012 Last » Next »