5153 search results - page 593 / 1031 » Introduction to Randomized Algorithms |
155
click to vote
GCB
1997
Springer
15 years 10 months ago
1997
Springer
Motivation: Database search programs such as FASTA, BLAST or a rigorous Smith–Waterman algorithm produce lists of database entries, which are assumed to be related to the query....
146
click to vote
WDAG
1992
Springer
15 years 10 months ago
1992
Springer
Abstract. The Choice Coordination Problem with k alternatives (kCCP) was introduced by Rabin in 1982 [Rab82]. The goal is to design a wait-free protocol for n asynchronous processe...
158
click to vote
ALDT
2009
Springer
15 years 10 months ago
2009
Springer
We study the problem of allocating a set of indivisible items to players having additive utility functions over the items. We consider allocations in which no player envies the bun...
174
click to vote
GBRPR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In this paper, we propose a novel method for the unsupervised clustering of graphs in the context of the constellation approach to object recognition. Such method is an E...
185
click to vote
ICANN
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Trained support vector machines (SVMs) have a slow runtime classification speed if the classification problem is noisy and the sample data set is large. Approximating the...