This paper studies a new query on uncertain data, called k-selection query. Given an uncertain dataset of N objects, where each object is associated with a preference score and a p...
Xingjie Liu, Mao Ye, Jianliang Xu, Yuan Tian, Wang...
Relational datasets, i.e., datasets in which individuals are described both by their own features and by their relations to other individuals, arise from various sources such as d...
Implicit surface modeling systems have been used since the mid-1980s for the generation of cartoon-like characters. Recently implicit models combined with constructive solid geome...
Callum Galbraith, Przemyslaw Prusinkiewicz, Brian ...
Abstract—This paper studies the problem of distributed computation over a network of wireless sensors. While this problem applies to many emerging applications, to keep our discu...
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...