Sciweavers

791 search results - page 19 / 159
» Characterizing zero-derivative points
Sort
View
ECOOP
2004
Springer
14 years 1 months ago
An AOP Implementation Framework for Extending Join Point Models
Mechanisms in AOP (aspect-oriented programming) can be characterized by a JPM (join point model). AOP is effective in unanticipated software evolution because crosscutting concer...
Naoyasu Ubayashi, Hidehiko Masuhara, Tetsuo Tamai
DGCI
2005
Springer
14 years 1 months ago
The Class of Simple Cube-Curves Whose MLPs Cannot Have Vertices at Grid Points
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
Fajie Li, Reinhard Klette
AGP
1993
IEEE
13 years 11 months ago
A Note on Logic Programming Fixed-Point Semantics
In this paper, we present an account of classical Logic Programming fixed-point semantics in terms of two standard categorical constructions in which the least Herbrand model is ...
Vladimiro Sassone
FOCS
2006
IEEE
14 years 1 months ago
Points on Computable Curves
The “analyst’s traveling salesman theorem” of geometric measure theory characterizes those subsets of Euclidean space that are contained in curves of finite length. This re...
Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo
CORR
2010
Springer
158views Education» more  CORR 2010»
13 years 4 months ago
Counting in Graph Covers: A Combinatorial Characterization of the Bethe Entropy Function
We present a combinatorial characterization of the Bethe entropy function of a factor graph, such a characterization being in contrast to the original, analytical, definition of th...
Pascal O. Vontobel