458 search results - page 50 / 92 » Linear Time Algorithms for Clustering Problems in Any Dimens... |
IJSNET
2008
13 years 8 months ago
2008
: Suppose we need to watch a set of targets continuously for a required period of time, and suppose we choose any number of sensors from a fixed set of sensor types and place them ...
ICML
2008
IEEE
14 years 9 months ago
2008
IEEE
We study the problem of finding the dominant eigenvector of the sample covariance matrix, under additional constraints on the vector: a cardinality constraint limits the number of...
GECCO
2009
Springer
14 years 3 months ago
2009
Springer
This work provides an analysis of using the evolutionary algorithm EPNet to create ensembles of artificial neural networks to solve a range of forecasting tasks. Several previous...
ICDE
2002
IEEE
14 years 9 months ago
2002
IEEE
We examine the problem of processing temporal joins in the presence of indexing schemes. Previous work on temporal joins has concentrated on non-indexed relations which were fully...
ICCI
1991
14 years 11 hour ago
1991
The problem of coloring a set of n intervals (from the real line) with a set of k colors is studied. In such a coloring, two intersecting intervals must receive distinct colors. O...