2638 search results - page 484 / 528 » Extracting Approximate Patterns |
UC
2009
Springer
15 years 6 months ago
2009
Springer
Geometrical Computation and Computable Analysis J´erˆome Durand-Lose⋆ Laboratoire d’Informatique Fondamentale d’Orl´eans, Universit´e d’Orl´eans, B.P. 6759, F-45067 OR...
129
click to vote
ASIAMS
2007
IEEE
15 years 6 months ago
2007
IEEE
This talk has two parts explaining the significance of Rough sets in granular computing in terms of rough set rules and in uncertainty handling in terms of lower and upper approxi...
125
click to vote
IPSN
2007
Springer
15 years 6 months ago
2007
Springer
In this paper we propose a lightweight algorithm for constructing multi-resolution data representations for sensor networks. We compute, at each sensor node u, O(log n) aggregates...
103
click to vote
SEMWEB
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Similarity has become a classical tool for ontology confrontation motivated by alignment, mapping or merging purposes. In the definition of an ontologybased measure one ...
ICDCS
2006
IEEE
15 years 5 months ago
2006
IEEE
Network coordinates provide a scalable way to estimate latencies among large numbers of hosts. While there are several algorithms for producing coordinates, none account for the f...