329 search results - page 16 / 66 » Uniform variable splitting |
151
click to vote
MDM
2004
Springer
16 years 1 days ago
2004
Springer
TPR-tree is a practical index structure for moving object databases. Due to the uniform distribution assumption, TPR-tree’s bulk loading algorithm (TPR) is relatively inefficie...
179
click to vote
DKE
2007
15 years 6 months ago
2007
We are interested in specifying functional dependencies (FDs) for data-centric XML documents (XML documents that are used mainly for data storage). FDs are a natural constraint. S...
151
click to vote
MP
2010
15 years 5 months ago
2010
We study the mixed-integer rounding (MIR) closures of polyhedral sets. The MIR closure of a polyhedral set is equal to its split closure and the associated separation problem is N...
158
click to vote
OOPSLA
1987
Springer
15 years 10 months ago
1987
Springer
This paper shows how an attempt at a uniform and reflective definition resulted in an open-ended system supporting ObjVlisp, which we use to simulate object-oriented language exte...
194
click to vote
DAM
2006
15 years 6 months ago
2006
There are many randomized "divide and conquer" algorithms, such as randomized Quicksort, whose operation involves partitioning a problem of size n uniformly at random int...