We provide a system for surfing the web at a high level of abstraction, which is an analogy of the web browser, but which displays entire sites at a time. It allows a principled i...
Abstract. Algorithms or target functions for graph clustering rarely admit quality guarantees or optimal results in general. Based on properties of minimum-cut trees, a clustering ...
We overview a new method for computing the arrangement of semi-algebraic curves. A subdivision approach is used to compute the topology of the algebraic objects and to segment the...
– This paper addresses a service-mining technique and applies this technique to improve the services of vehicle service centers. We propose a service-mining system and its data s...
In this paper we consider the problem of estimating discrete variables in a class of hybrid systems where we assume that the continuous variables are available for measurement. Usi...