10997 search results - page 121 / 2200 » On the Structure of Complete Sets |
226
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
In contrast to classical databases and IR systems, real-world information systems have to deal increasingly with very vague and diverse structures for information management and s...
167
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
We present a compositional program logic for call-by-value imperative higher-order functions with general forms of aliasing, which can arise from the use of reference names as fun...
225
click to vote
3DIC
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—Modeling parasitic parameters of Through-SiliconVia (TSV) structures is essential in exploring electrical characteristics such as delay and signal integrity (SI) of circ...
148
click to vote
SIGMOD
1997
ACM
15 years 10 months ago
1997
ACM
This paper presents general algorithms for concurrency control in tree-based access methods as well as a recovery protocol and a mechanism for ensuring repeatable read. The algori...
132
click to vote
ANOR
2008
15 years 6 months ago
2008
: Semiorders may form the simplest class of ordered sets with a not necessarily transitive indifference relation. Their generalization has given birth to many other classes of orde...