Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...
We describe KDD-Cup 2000, the yearly competition in data mining. For the first time the Cup included insight problems in addition to prediction problems, thus posing new challenge...
Ron Kohavi, Carla E. Brodley, Brian Frasca, Llew M...
Abstract. Volumetric structures are frequently used as shape descriptors for 3D data. The capture of such data is being facilitated by developments in multi-view video and range sc...
Gabriel J. Brostow, Irfan A. Essa, Drew Steedly, V...
Abstract. Volume datasets have been a primary representation for scientific visualization with the advent of rendering algorithms such as marching cubes and ray casting. Nonethele...
With the increased availability of data for complex domains, it is desirable to learn Bayesian network structures that are sufficiently expressive for generalization while at the ...