279 search results - page 9 / 56 » Exact Algorithms for Cluster Editing: Evaluation and Experim... |
DASFAA
2009
IEEE
15 years 6 months ago
2009
IEEE
Many applications need to solve the problem of approximate string matching with block moves. It is an NP-Complete problem to compute block edit distance between two strings. Our go...
ARITH
2007
IEEE
15 years 6 months ago
2007
IEEE
The compensated Horner algorithm improves the accuracy of polynomial evaluation in IEEE-754 floating point arithmetic: the computed result is as accurate as if it was computed wi...
RECOMB
2004
Springer
15 years 12 months ago
2004
Springer
d abstract) John Kececioglu and Dean Starrett Department of Computer Science The University of Arizona Tucson AZ 85721, USA A basic computational problem that arises in both the...
SDM
2009
SIAM
15 years 9 months ago
2009
SIAM
In this paper, we propose GAD (General Activity Detection) for fast clustering on large scale data. Within this framework we design a set of algorithms for different scenarios: (...
IJCNLP
2005
Springer
15 years 5 months ago
2005
Springer
Document clustering has many uses in natural language tools and applications. For instance, summarizing sets of documents that all describe the same event requires first identifyi...