1941 search results - page 91 / 389 » On the Hardness of Approximate Reasoning |
105
click to vote
BMCBI
2006
14 years 12 months ago
2006
Background: Single nucleotide polymorphisms (SNPs) are locations at which the genomic sequences of population members differ. Since these differences are known to follow patterns,...
105
click to vote
FUIN
2006
14 years 12 months ago
2006
We consider approximate pattern matching in natural language text. We use the words of the text as the alphabet, instead of the characters as in traditional string matching approac...
130
click to vote
MST
2010
14 years 6 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
102
click to vote
STOC
2003
ACM
16 years 6 days ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
143
click to vote
COMPGEOM
2010
ACM
15 years 5 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...