We present a novel algorithm, Compact Kd-Trees (CompactKdt), that achieves state-of-the-art performance in searching large scale object image collections. The algorithm uses an or...
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
In order to support the efficient development of NL generation systems, two orthogonal •methods are currently pursued with emphasis: (i) reusable, general, and linguistically•...
In order to heighten the effectiveness of web-based exploratory learning, we have designed and implemented adaptive link generation that facilitates multiperspective thinking abou...
We discuss how constraint programming can improve the performance of a column generation solution process for the NP-hard Tail Assignment problem in aircraft scheduling. Combining...