2766 search results - page 288 / 554 » Algorithms for trigonometric polynomials |
146
Voted
IPPS
2005
IEEE
15 years 10 months ago
2005
IEEE
We propose a new self-stabilizing anonymous leader election algorithm in a tree graph. We show the correctness of the protocol and show that the protocol terminates in O(n4 ) time...
159
click to vote
RTCSA
2005
IEEE
15 years 10 months ago
2005
IEEE
In some real-time application systems, there are only a few distinct kinds of tasks, each of which may be instantiated several times during runtime. The scheduling of such sporadi...
136
Voted
ISAAC
2005
Springer
15 years 10 months ago
2005
Springer
We present upper bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM time is no more powerful than sequential space, thus gi...
171
click to vote
ICGI
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. A base problem in Web information extraction is to find appropriate queries for informative nodes in trees. We propose to learn queries for nodes in trees automatically ...
157
Voted
SETA
2004
Springer
15 years 10 months ago
2004
Springer
We study algebraic feedback shift registers (AFSRs) based on quotients of polynomial rings in several variables over a finite field. These registers are natural generalizations o...