5100 search results - page 700 / 1020 » The Linear Complexity of a Graph |
170
click to vote
ANTS
2006
Springer
15 years 10 months ago
2006
Springer
We provide a modular method for computing the splitting field Kf of an integral polynomial f by suitable use of the byproduct of computation of its Galois group Gf by p-adic Staudu...
169
click to vote
CGI
2004
IEEE
15 years 10 months ago
2004
IEEE
Patch-based texture synthesis has proven to produce high quality textures faster than pixel-based approaches. Previous algorithms differ in how the regions of overlap between neig...
153
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
Deciding what to branch on at each node is a key element of search algorithms. We present four families of methods for selecting what question to branch on. They are all informati...
176
click to vote
CMSB
2004
Springer
15 years 10 months ago
2004
Springer
We propose a robust estimation method of gene networks based on microarray gene expression data. It is well-known that microarray data contain a large amount of noise and some outl...
161
click to vote
AUSAI
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We present a new method for voting exponential (in the number of attributes) size sets of Bayesian classifiers in polynomial time with polynomial memory requirements. Tra...