3510 search results - page 610 / 702 » Searching with numbers |
177
click to vote
KDD
2000
ACM
15 years 10 months ago
2000
ACM
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
167
click to vote
SC
1995
ACM
15 years 10 months ago
1995
ACM
The problem of determining the evolutionary history of species in the form of phylogenetic trees is known as the phylogeny problem. We present a parallelization of the character c...
185
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Many applications of networks of agents, including mobile sensor networks, unmanned air vehicles, autonomous underwater vehicles, involve 100s of agents acting collaboratively und...
181
click to vote
CPM
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
204
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
Inverted indexes using sequences of characters (n-grams) as terms provide an error-resilient and language-independent way to query for arbitrary substrings and perform approximate...