538 search results - page 82 / 108 » Applying Interchangeability Techniques to the Distributed Br... |
192
click to vote
SSD
2007
Springer
15 years 9 months ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
127
click to vote
BMCBI
2007
15 years 3 months ago
2007
Background: Genome-wide identification of specific oligonucleotides (oligos) is a computationallyintensive task and is a requirement for designing microarray probes, primers, and ...
144
click to vote
SOFSEM
2000
Springer
15 years 6 months ago
2000
Springer
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
154
click to vote
SAC
2006
ACM
15 years 9 months ago
2006
ACM
“The curse of dimensionality” is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimension...
141
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
This paper provides the first explicit construction of extractors which are simultaneously optimal up to constant factors in both seed length and output length. More precisely, fo...