1100 search results - page 196 / 220 » Approximate distance oracles |
137
click to vote
KDD
2006
ACM
16 years 3 months ago
2006
ACM
This work introduces distance-based criteria for segmentation of object trajectories. Segmentation leads to simplification of the original objects into smaller, less complex primi...
237
Voted
POPL
2006
ACM
16 years 3 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
235
Voted
Lab
The Digital Systems and Media Computing Laboratory (DSMC Lab) was established in the end of 2002 and is located in Patras, Greece. DSMC operates under the School of Sciences and Te...
129
Voted
CIKM
2007
Springer
15 years 9 months ago
2007
Springer
Queries issued by casual users or specialists exploring a data set often point us to important subsets of the data, be it clusters, outliers or other features of particular import...
144
Voted
SBCCI
2003
ACM
15 years 8 months ago
2003
ACM
Unsupervised clustering is a powerful technique for understanding multispectral and hyperspectral images, being k-means one of the most used iterative approaches. It is a simple th...