Sciweavers

1204 search results - page 44 / 241
» Termination of Polynomial Programs
Sort
View
DATE
2003
IEEE
106views Hardware» more  DATE 2003»
14 years 4 months ago
Reconfigurable Signal Processing in Wireless Terminals
In this paper, we show the necessity of reconfigurable hardware for data and signal processing in wireless mobile terminals. We first identify the key processing power requirement...
Jürgen Helmschmidt, Eberhard Schüler, Pr...
HICSS
2002
IEEE
119views Biometrics» more  HICSS 2002»
14 years 4 months ago
A New Buffer Management Scheme for Multimedia Terminals in Broadband Satellite Networks
In the recent years, there has been a growing interest in broadband satellite networks. Broadband satellite networks are designed to provide the required qualify of service (QoS) ...
Mahnoosh Mobasseri, Victor C. M. Leung
LPNMR
2011
Springer
13 years 1 months ago
Communicating ASP and the Polynomial Hierarchy
Communicating answer set programming is a framework to represent and reason about the combined knowledge of multiple agents using the idea of stable models. The semantics and expre...
Kim Bauters, Steven Schockaert, Dirk Vermeir, Mart...
JSC
2007
106views more  JSC 2007»
13 years 11 months ago
Computing multihomogeneous resultants using straight-line programs
We present a new algorithm for the computation of resultants associated with multihomogeneous (and, in particular, homogeneous) polynomial equation systems using straight-line pro...
Gabriela Jeronimo, Juan Sabia
TOMS
2010
106views more  TOMS 2010»
13 years 9 months ago
Computing Tutte Polynomials
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both comb...
Gary Haggard, David J. Pearce, Gordon Royle