1387 search results - page 175 / 278 » Convexity in Discrete Space |
ALENEX
2003
13 years 10 months ago
2003
We present a data structure, called a ray interpolant tree, or RI-tree, which stores a discrete set of directed lines in 3-space, each represented as a point in 4-space. Each dire...
TC
2008
13 years 9 months ago
2008
While many block replacement algorithms for buffer caches have been proposed to address the wellknown drawbacks of the LRU algorithm, they are not robust and cannot maintain a cons...
NN
2002
Springer
13 years 8 months ago
2002
Springer
The self-organising map (SOM) has been successfully employed as a nonparametric method for dimensionality reduction and data visualisation. However, for visualisation the SOM requ...
ICB
2009
Springer
13 years 6 months ago
2009
Springer
Stemming from a sound mathematical framework dating back to the beginning of the 20th century, this paper introduces a novel approach for 3D face recognition. The proposed techniqu...
BMCBI
2002
13 years 8 months ago
2002
Background: Recently, Almeida and Vinga offered a new approach for the representation of arbitrary discrete sequences, referred to as Universal Sequence Maps (USM), and discussed ...