2766 search results - page 329 / 554 » Algorithms for trigonometric polynomials |
144
click to vote
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...
139
click to vote
COMPGEOM
2000
ACM
15 years 8 months ago
2000
ACM
The purpose of this paper is to present a new method to design exact geometric predicates in algorithms dealing with curved objects such as circular arcs. We focus on the comparis...
154
click to vote
STACS
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. We compare classical and quantum query complexities of total Boolean functions. It is known that for worst-case complexity, the gap between quantum and classical can be a...
150
click to vote
ECSQARU
1995
Springer
15 years 8 months ago
1995
Springer
The paper presents a method for uncertainty propagation in Bayesian networks in symbolic, as opposed to numeric, form. The algebraic structure of probabilities is characterized. Th...
145
Voted
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...