502 search results - page 40 / 101 » Verifying Balanced Trees |
ICALP
2001
Springer
14 years 2 months ago
2001
Springer
Given an undirected graph with positive edge weights, define Nq(v) for each node v to be the set of q nodes closest to v (including v itself and breaking ties by node ID). It is ...
JMS
2010
13 years 8 months ago
2010
This paper describes the development of a tree-based decision model to predict the severity of pediatric asthma exacerbations in the emergency department (ED) at two hours followi...
ICMLA
2010
13 years 8 months ago
2010
Ordinal classification is a form of multi-class classification where there is an inherent ordering between the classes, but not a meaningful numeric difference between them. Althou...
POPL
2010
ACM
14 years 7 months ago
2010
ACM
Serializability is a commonly used correctness condition in concurrent programming. When a concurrent module is serializable, certain other properties of the module can be verifie...
BNCOD
2004
13 years 11 months ago
2004
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. Like many spatial access methods, the M-tree's perfo...