We study the random m-ary search tree model (where m stands for the number of branches of the search tree), an important problem for data storage in computer science, using a varie...
Satya N. Majumdar, David S. Dean, Paul L. Krapivsk...
The goal of discriminant analysis is to obtain rules that describe the separation between groups of observations. Moreover it allows to classify new observations into one of the k...
This paper considers interaction of the human arm with ``virtual'' objects simulated mechanically by a planar robot. Haptic perception of spatial properties of objects is...
Ernest D. Fasse, Neville Hogan, Bruce A. Kay, Ferd...
We present an approach to building multicast services at the network layer using unicast forwarding and two additional building blocks: (i) ephemeral state probes, i.e. extremely l...
We address the problem of predicting how people will spontaneously divide into groups a set of novel items. This is a process akin to perceptual organization. We therefore employ ...