Sciweavers

1646 search results - page 90 / 330
» fast 2007
Sort
View
114
Voted
ATMOS
2007
114views Optimization» more  ATMOS 2007»
15 years 2 months ago
Fast Approaches to Robust Railway Timetabling
The Train Timetabling Problem (TTP) consists in finding a train schedule on a railway network that satisfies some operational constraints and maximizes a profit function which c...
Matteo Fischetti, Arrigo Zanette, Domenico Salvagn...
SDM
2007
SIAM
201views Data Mining» more  SDM 2007»
15 years 2 months ago
Fast Best-Match Shape Searching in Rotation Invariant Metric Spaces
Object recognition and content-based image retrieval systems rely heavily on the accurate and efficient identification of shapes. A fundamental requirement in the shape analysis ...
Dragomir Yankov, Eamonn J. Keogh, Li Wei, Xiaopeng...
91
Voted
WCE
2007
15 years 1 months ago
A Fast Multivariate Nearest Neighbour Imputation Algorithm
— Imputation of missing data is important in many areas, such as reducing non-response bias in surveys and maintaining medical documentation. Nearest neighbour (NN) imputation al...
Norman Solomon, Giles Oatley, Kenneth McGarry
CG
2007
Springer
15 years 24 days ago
A fast all nearest neighbor algorithm for applications involving large point-clouds
Algorithms that use point-cloud models make heavy use of the neighborhoods of the points. These neighborhoods are used to compute the surface normals for each point, mollificatio...
Jagan Sankaranarayanan, Hanan Samet, Amitabh Varsh...
121
Voted
CORR
2007
Springer
132views Education» more  CORR 2007»
15 years 23 days ago
Fast Algorithm and Implementation of Dissimilarity Self-Organizing Maps
In many real-world applications, data cannot be accurately represented by vectors. In those situations, one possible solution is to rely on dissimilarity measures that enable a se...
Brieuc Conan-Guez, Fabrice Rossi, Aïcha El Go...