2766 search results - page 333 / 554 » Algorithms for trigonometric polynomials |
139
click to vote
DAM
2007
15 years 4 months ago
2007
It is shown that the set of hybrid one-dimensional reversible cellular automata (CA) with the periodic boundary condition is a regular set. This has several important consequences...
119
click to vote
JSC
2006
15 years 4 months ago
2006
We provide a polyhedral description of the conditions for the existence of the maximum likelihood estimate (MLE) for a hierarchical log-linear model. The MLE exists if and only if...
147
click to vote
SIAMCOMP
2008
15 years 4 months ago
2008
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r P, and a length constraint B, one needs to find a path starting from r tha...
163
Voted
JAR
2007
15 years 4 months ago
2007
As applications of description logics proliferate, efficient reasoning with knowledge bases containing many assertions becomes ever more important. For such cases, we developed a n...
150
click to vote
ALGORITHMICA
2004
15 years 4 months ago
2004
We consider the Chromatic Sum Problem on bipartite graphs which appears to be much harder than the classical Chromatic Number Problem. We prove that the Chromatic Sum Problem is NP...