2992 search results - page 191 / 599 » Semantic Distance Measures |
144
click to vote
SEMWEB
2010
Springer
15 years 2 months ago
2010
Springer
We develop query relaxation techniques for regular path queries and combine them with query approximation in order to support flexible querying of RDF data when the user lacks know...
125
click to vote
SWAT
2004
Springer
15 years 9 months ago
2004
Springer
For a collection F of d-variate piecewise linear functions of overall combinatorial complexity n, the lower envelope E(F) of F is the pointwise minimum of these functions. The min...
137
click to vote
DMKD
2003
ACM
15 years 9 months ago
2003
ACM
The parallel explosions of interest in streaming data, and data mining of time series have had surprisingly little intersection. This is in spite of the fact that time series data...
126
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—Sensor network localization is an instance of the NP-HARD graph realization problem. Thus, methods used in practice are not guaranteed to find the correct localization, even if...
124
click to vote
ICDM
2007
IEEE
15 years 10 months ago
2007
IEEE
K-means is a widely used partitional clustering method. A large amount of effort has been made on finding better proximity (distance) functions for K-means. However, the common c...