Sciweavers

9503 search results - page 1496 / 1901
» Authenticated System Calls
Sort
View
ICLP
2005
Springer
16 years 12 days ago
Polynomial Interpretations as a Basis for Termination Analysis of Logic Programs
Our goal is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm. In this paper, we show how to adapt ter...
Manh Thang Nguyen, Danny De Schreye
IDEAL
2005
Springer
16 years 12 days ago
Identification of Anomalous SNMP Situations Using a Cooperative Connectionist Exploratory Projection Pursuit Model
Abstract. The work presented in this paper shows the capability of a connectionist model, based on a statistical technique called Exploratory Projection Pursuit (EPP), to identify ...
Álvaro Herrero, Emilio Corchado, José...
IPSN
2005
Springer
16 years 12 days ago
Building up to macroprogramming: an intermediate language for sensor networks
Abstract— There is widespread agreement that a higher level programming model for sensor networks is needed. A variety of models have been developed, but the community is far fro...
Ryan Newton, Arvind, Matt Welsh
ISSAC
2005
Springer
115views Mathematics» more  ISSAC 2005»
16 years 12 days ago
Algorithms for the non-monic case of the sparse modular GCD algorithm
Let G = (4y2 + 2z)x2 + (10y2 + 6z) be the greatest common divisor (gcd) of two polynomials A, B ∈   [x,y, z]. Because G is not monic in the main variable x, the sparse modular ...
Jennifer de Kleine, Michael B. Monagan, Allan D. W...
LCPC
2005
Springer
16 years 12 days ago
A Language for the Compact Representation of Multiple Program Versions
Abstract. As processor complexity increases compilers tend to deliver suboptimal performance. Library generators such as ATLAS, FFTW and SPIRAL overcome this issue by empirically s...
Sébastien Donadio, James C. Brodman, Thomas...
« Prev « First page 1496 / 1901 Last » Next »