A union-find data structure maintains a collection of disjoint sets under makeset, union and find operations. Kaplan, Shafrir and Tarjan [SODA 2002] designed data structures for ...
This presentation has two goals: (i) to review the recently suggested concept of bio-inspired CrossNet architectures for future hybrid CMOL VLSI circuits and (ii) to present new re...
Information integration is often faced with the problem that different data sources represent the same set of the real-world objects, but give conflicting values for specific prop...
Abstract. This paper discusses various classifications of component interoperability errors.These classifications aim at supporting the automation of component adaptation. The us...
Artificial Intelligence algorithms can be divided into two groups according to the type of problems they solve. Knowledge-intensive domains contain explicit knowledge, whereas know...