2766 search results - page 404 / 554 » Algorithms for trigonometric polynomials |
127
click to vote
SODA
2004
ACM
15 years 5 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
149
Voted
AAAI
1996
15 years 5 months ago
1996
We present a connectionist architecture that supports almost instantaneous deductive and abductive reasoning. The deduction algorithm responds in few steps for single rule queries...
141
click to vote
ISMB
1994
15 years 5 months ago
1994
Wepresent algorithms for kinematic manipulation of molecular chains subject to fixed bond lengths and bond angles. They are useful for calculating conformations of a molecule subj...
108
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We consider the problem of rate allocation in a Gaussian multiple-access channel, with the goal of maximizing a utility function over transmission rates. In contrast to the literat...
144
Voted
ENDM
2008
15 years 4 months ago
2008
A circular-arc graph is the intersection graph of a set of arcs on the circle. It is a Helly circular-arc graph if it has a Helly model, where every maximal clique is the set of a...