1632 search results - page 69 / 327 » Sublinear Time Algorithms for Metric Space Problems |
128
Voted
AAAI
2004
15 years 4 months ago
2004
Oversubscribed scheduling problems require removing or partially satisfying tasks when enough resources are not available. For a particular oversubscribed problem, Air Force Satel...
153
Voted
WIRN
2005
Springer
15 years 9 months ago
2005
Springer
We present an algorithmic scheme for unsupervised cluster ensembles, based on randomized projections between metric spaces, by which a substantial dimensionality reduction is obtai...
118
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. We consider the clustering with diversity problem: given a set of colored points in a metric space, partition them into clusters such that each cluster has at least point...
145
Voted
FPGA
2007
ACM
15 years 9 months ago
2007
ACM
The application-specific multiprocessor System-on-a-Chip is a promising design alternative because of its high degree of flexibility, short development time, and potentially high ...
300
Voted
ICA
2012
Springer
13 years 11 months ago
2012
Springer
Abstract. The use of high level information in source separation algorithms can greatly constrain the problem and lead to improved results by limiting the solution space to semanti...