1522 search results - page 249 / 305 » On the Complexity of Several Haplotyping Problems |
CORR
2011
Springer
14 years 4 months ago
2011
Springer
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
ICCV
2009
IEEE
16 years 2 months ago
2009
IEEE
Many machine learning algorithms require the summation of Gaussian kernel
functions, an expensive operation if implemented straightforwardly. Several methods
have been proposed t...
113
click to vote
PODS
2005
ACM
15 years 10 months ago
2005
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. Pro...
PODS
2006
ACM
15 years 10 months ago
2006
ACM
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
EDBT
2010
ACM
15 years 4 months ago
2010
ACM
Although keyword query enables inexperienced users to easily search XML database with no specific knowledge of complex structured query languages or XML data schemas, the ambigui...