697 search results - page 61 / 140 » Approximation of Information Granule Sets |
CORR
2010
Springer
15 years 24 days ago
2010
Springer
We address the problem of building an index for a set D of n strings, where each string location is a subset of some finite integer alphabet of size , so that we can answer effici...
75
Voted
PAMI
2006
15 years 19 days ago
2006
In this article we present a novel convexity measure for object shape analysis. The proposed method is based on the idea of generating pairs of points from a set, and measuring th...
229
click to vote
ICDE
2007
IEEE
16 years 2 months ago
2007
IEEE
The ability to store and query uncertain information is of great benefit to databases that infer values from a set of observations, including databases of moving objects, sensor r...
107
Voted
INFOCOM
2007
IEEE
15 years 7 months ago
2007
IEEE
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
105
click to vote
VLDB
2007
ACM
15 years 6 months ago
2007
ACM
This paper reports our first set of results on managing uncertainty in data integration. We posit that data-integration systems need to handle uncertainty at three levels, and do...