651 search results - page 2 / 131 » Index Sets and Universal Numberings |
ENTCS
2008
13 years 4 months ago
2008
bstraction Functor for Named Sets Vincenzo Ciancia 1 Ugo Montanari 1 Department of Computer Science University of Pisa lem of dening fully abstract operational models of name pass...
VLDB
1999
ACM
13 years 9 months ago
1999
ACM
Today’s object-relational DBMSs (ORDBMSs) are designed to support novel application domains by providing an extensible architecture, supplemented by domain-specific database ex...
HPCA
2004
IEEE
14 years 5 months ago
2004
IEEE
Using alternative cache indexing/hashing functions is a popular technique to reduce conflict misses by achieving a more uniform cache access distribution across the sets in the ca...
ICCS
2005
Springer
13 years 10 months ago
2005
Springer
In this paper we address two optimization problems arising in the design of genomic assays based on universal tag arrays. First, we address the universal array tag set design probl...
GD
2007
Springer
13 years 11 months ago
2007
Springer
This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this ...