Abstract. Finding paths in high-dimensional gemetric spaces is a provably hard problem. Recently, a general randomized planning scheme has emerged as an e ective approach to solve ...
David Hsu, Lydia E. Kavraki, Jean-Claude Latombe, ...
A number of three-dimensional information visualization designs have been invented during the last years. However, comparisons of such designs have been scarce, making it di cult ...
This paper presents a global constraint that enforces rules written in a language based on arithmetic and first-order logic to hold among a set of objects. In a first step, the rul...
Most of the biclustering algorithms for gene expression data are based either on the Euclidean distance or correlation coefficient which capture only linear relationships. However...
A serious problem in learning probabilistic models is the presence of hidden variables. These variables are not observed, yet interact with several of the observed variables. Dete...