1397 search results - page 265 / 280 » Algorithms for Proximity Problems on Colored Point Sets |
SPAA
2009
ACM
14 years 9 months ago
2009
ACM
Denial of service (DoS) attacks are arguably one of the most cumbersome problems in the Internet. This paper presents a distributed information system (over a set of completely co...
EDBT
2002
ACM
14 years 8 months ago
2002
ACM
Abstract. This work addresses the problem of querying moving objects databases. which capture the inherent uncertainty associated with the location of moving point objects. We addr...
COLT
2005
Springer
14 years 2 months ago
2005
Springer
We consider the problem of learning mixtures of distributions via spectral methods and derive a tight characterization of when such methods are useful. Specifically, given a mixt...
TCSB
2008
13 years 8 months ago
2008
Clustering gene expression data given in terms of time-series is a challenging problem that imposes its own particular constraints, namely exchanging two or more time points is not...
KDD
2007
ACM
14 years 8 months ago
2007
ACM
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...