Concept lattices built on noisy data tend to be large and hence hard to interpret. We introduce several measures that can be used in selecting relevant concepts and discuss how the...
Mikhail Klimushkin, Sergei A. Obiedkov, Camille Ro...
We present the zipper tree, the first O(log log n)-competitive online binary search tree that performs each access in O(log n) worst-case time. This shows that for binary search ...
Teaching software engineering at the undergraduate level is an exciting and challenging undertaking. Students come to software engineering with a variety of technical and sift ski...
The semantic web is a general vision for supporting knowledge-based processing across the WWW and its successors. As such, semantic web technology has potential to support the exc...
In this work, we describe a subword unit approach for information retrieval of items by voice. An algorithm based on the minimum description length (MDL) principle converts an ind...