1632 search results - page 56 / 327 » Sublinear Time Algorithms for Metric Space Problems |
227
Voted
ISNN
2011
Springer
14 years 6 months ago
2011
Springer
This paper presents a new method that uses orthogonalized features for time series clustering and classification. To cluster or classify time series data, either original data or...
135
Voted
ICRA
2007
IEEE
15 years 9 months ago
2007
IEEE
— Most robotic vision algorithms are proposed by envisaging robots operating in structured environments where the world is assumed to be rigid. These algorithms fail to provide o...
132
click to vote
ICCV
2009
IEEE
16 years 8 months ago
2009
IEEE
Fast retrieval methods are critical for large-scale and
data-driven vision applications. Recent work has explored
ways to embed high-dimensional features or complex distance
fun...
115
click to vote
DAC
2005
ACM
16 years 4 months ago
2005
ACM
Power minimization under variability is formulated as a rigorous statistical robust optimization program with a guarantee of power and timing yields. Both power and timing metrics...
172
click to vote
FAW
2010
Springer
15 years 3 months ago
2010
Springer
We study the minimum diameter color-spanning set problem which has recently drawn some attention in the database community. We show that the problem can be solved in polynomial tim...