In order to efficiently determine structural relationships among XML elements and to avoid re-labeling for updates, much research about labeling schemes has been conducted, recentl...
We describe Occam, a query planning algorithm that determines the best way to integrate data from dierent sources. As input, Occam takes a library of site descriptions and a user ...
Simulation studies are frequently used to evaluate new peer-to-peer searching techniques as well as existing techniques on new applications. Unless these studies are accurate in th...
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...
Abstract. This paper proposes a fuzzy-rough method of maintaining CaseBased Reasoning (CBR) systems. The methodology is mainly based on the idea that a large case library can be tr...