1100 search results - page 127 / 220 » Approximate distance oracles |
147
click to vote
Publication
Drawbacks of the traditional scenario of image modeling by Gibbs random fields with multiple pairwise pixel interactions are outlined, and a more reasonable alternative scenario b...
TRIDENTCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
We present our experiences and investigations with an experimental metropolitan multi-radio mesh network that covers an area of approximately 60 Km2 in the city of Heraklion, Cret...
83
Voted
ICDE
2006
IEEE
15 years 4 months ago
2006
IEEE
Widespread interest in time-series similarity search has made more in need of efficient technique, which can reduce dimensionality of the data and then to index it easily using a ...
ACSC
2005
IEEE
15 years 3 months ago
2005
IEEE
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...
109
click to vote
WIRN
2005
Springer
15 years 3 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...