279 search results - page 29 / 56 » Exact Algorithms for Cluster Editing: Evaluation and Experim... |
188
click to vote
HT
2006
ACM
16 years 17 days ago
2006
ACM
A method of using string-matching to analyze hypertext navigation was developed, and evaluated using two weeks of website logfile data. The method is divided into phases that use:...
289
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
195
click to vote
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
Many applications employ sensors for monitoring entities such as temperature and wind speed. A centralized database tracks these entities to enable query processing. Due to contin...
174
click to vote
ICDM
2008
IEEE
16 years 1 months ago
2008
IEEE
We study the problem of clustering uncertain objects whose locations are described by probability density functions (pdf). We show that the UK-means algorithm, which generalises t...
186
click to vote
NBIS
2007
Springer
16 years 22 days ago
2007
Springer
Range queries, retrieving all keys within a given range, is an important add-on for Distributed Hash Tables (DHTs), as they rely only on exact key matching lookup. In this paper we...