2766 search results - page 224 / 554 » Algorithms for trigonometric polynomials |
129
Voted
ICCAD
1996
IEEE
15 years 9 months ago
1996
IEEE
Although numerous methods have been proposed for interconnect simulation, no single model exists for all kind of transmission line problems. This paper presents a new, single, gen...
189
Voted
STACS
1994
Springer
15 years 9 months ago
1994
Springer
The complexity of the simple maxcut problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the follo...
163
click to vote
FSTTCS
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We investigate streaming evaluation of filters on XML documents, evaluated both at the root node and at an arbitrary node. Motivated by applications in protocol processin...
156
click to vote
ICALP
2000
Springer
15 years 9 months ago
2000
Springer
We consider the problem of scheduling n independent jobs on m identical machines that operate in parallel. Each job has a controllable processing time. The fact that the jobs have...
167
click to vote
IMAMS
2007
15 years 6 months ago
2007
In this paper, we consider the problem of analysing the shape of an object defined by polynomial equations in a domain. We describe regularity criteria which allow us to determine...