15073 search results - page 338 / 3015 » Probabilistic algorithms for computing resultants |
154
click to vote
CONCUR
2006
Springer
15 years 8 months ago
2006
Springer
A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions specified as Ra...
148
Voted
LATIN
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. We study the computational complexity of deciding the existence of a Hamiltonian Cycle in some dense classes of k-uniform hypergraphs. Those problems turned out to be, al...
127
click to vote
EGC
2005
Springer
15 years 10 months ago
2005
Springer
Computational grid provides a platform for exploiting various computational resources over wide area networks. One of the concerns in implementing computational grid environment is...
145
click to vote
BMCBI
2007
15 years 5 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 ...
145
click to vote
IJFCS
2006
15 years 4 months ago
2006
We initiate a systematic study of the Row Deletion(B) problem on matrices: Given an input matrix A and a fixed "forbidden submatrix" B, the task is to remove a minimum n...