1041 search results - page 67 / 209 » Randomizing Reductions of Search Problems |
CSCLP
2005
Springer
14 years 1 months ago
2005
Springer
This paper presents an attempt to construct a ”practical” CSP algorithm that assigns a variable with 2 values at every step. Such a strategy has been successfully used for cons...
RECOMB
2002
Springer
14 years 8 months ago
2002
Springer
This paper concerns the discovery of patterns in gene expression matrices, in which each element gives the expression level of a given gene in a given experiment. Most existing me...
ALGORITHMICA
2006
13 years 8 months ago
2006
Algorithmic methods based on the theory of fixed-parameter tractability are combined with powerful computational platforms to launch systematic attacks on combinatorial problems o...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
In this paper, the task of selecting the optimal subset of pronunciation variants from a set of automatically generated candidates is recast as a tree search problem. In this appr...
PKC
1999
Springer
14 years 9 days ago
1999
Springer
One of the key directions in complexity theory which has also filtered through to cryptographic research, is the effort to classify related but seemingly distinct notions. Separa...