Sciweavers

484 search results - page 45 / 97
» Computing Hilbert Class Polynomials
Sort
View
WABI
2005
Springer
132views Bioinformatics» more  WABI 2005»
14 years 2 months ago
Perfect Sorting by Reversals Is Not Always Difficult
—We propose new algorithms for computing pairwise rearrangement scenarios that conserve the combinatorial structure of genomes. More precisely, we investigate the problem of sort...
Sèverine Bérard, Anne Bergeron, Cedr...
COCO
2001
Springer
108views Algorithms» more  COCO 2001»
14 years 1 months ago
Bounded Query Functions with Limited Output Bits
This paper explores the difference between parallel and serial queries to an NP-complete oracle, SAT, from the perspective of functions with a limited number of output bits. For ...
Richard Chang, Jon S. Squire
UAI
2000
13 years 10 months ago
Tractable Bayesian Learning of Tree Belief Networks
In this paper we present decomposable priors, a family of priors over structure and parameters of tree belief nets for which Bayesian learning with complete observations is tracta...
Marina Meila, Tommi Jaakkola
ICIP
2005
IEEE
14 years 10 months ago
Fourier transform for the spatial quincunx lattice
We derive a new, two-dimensional nonseparable signal transform for computing the spectrum of spatial signals residing on a finite quincunx lattice. The derivation uses the connect...
Markus Püschel, Martin Rötteler
CIE
2005
Springer
14 years 2 months ago
Some Reducibilities on Regular Sets
Abstract. We discuss some known and introduce some new reducibilities on regular sets. We establish some facts on the corresponding degree structures and relate some reducibilities...
Victor L. Selivanov