Sciweavers

3625 search results - page 99 / 725
» On choosing
Sort
View
PRL
2007
150views more  PRL 2007»
15 years 5 months ago
A method for initialising the K-means clustering algorithm using kd-trees
We present a method for initialising the K-means clustering algorithm. Our method hinges on the use of a kd-tree to perform a density estimation of the data at various locations. ...
Stephen J. Redmond, Conor Heneghan
EOR
2008
100views more  EOR 2008»
15 years 4 months ago
Urban rapid transit network capacity expansion
The rapid transit network design problem consists on the location of the train alignments and stations in an urban traffic context. The location problem incorporates the demand dec...
Ángel Marín, Patricia Jaramillo
JGO
2010
69views more  JGO 2010»
15 years 4 months ago
Solving the problem of packing equal and unequal circles in a circular container
In this paper we propose a Monotonic Basin Hopping approach and its population-based variant Population Basin Hopping to solve the problem of packing equal and unequal circles wit...
Andrea Grosso, A. R. M. J. U. Jamali, Marco Locate...
DLOG
2010
15 years 4 months ago
Guiding Reification in OWL through Aggregation
We put forward a methodological approach aimed at guiding ontology modellers in choosing which relations to reify. Our proposal is based on the notion of aggregation as used in con...
Paula Severi, José Luiz Fiadeiro, David Eks...
EMNLP
2010
15 years 4 months ago
Automatic Analysis of Rhythmic Poetry with Applications to Generation and Translation
We employ statistical methods to analyze, generate, and translate rhythmic poetry. We first apply unsupervised learning to reveal word-stress patterns in a corpus of raw poetry. W...
Erica Greene, Tugba Bodrumlu, Kevin Knight