Sciweavers

3616 search results - page 63 / 724
» Conditional Memory Ordering
Sort
View
COMBINATORICS
1998
103views more  COMBINATORICS 1998»
15 years 6 months ago
Recognizing Circulant Graphs of Prime Order in Polynomial Time
A circulant graph G of order n is a Cayley graph over the cyclic group Zn. Equivalently, G is circulant iff its vertices can be ordered such that the corresponding adjacency matr...
Mikhail E. Muzychuk, Gottfried Tinhofer
MOC
2002
128views more  MOC 2002»
15 years 6 months ago
Each averaging technique yields reliable a posteriori error control in FEM on unstructured grids. Part II: Higher order FEM
Averaging techniques are popular tools in adaptive finite element methods since they provide efficient a posteriori error estimates by a simple postprocessing. In the second paper ...
Sören Bartels, Carsten Carstensen
FORMATS
2009
Springer
16 years 1 months ago
Critical Paths in the Partial Order Unfolding of a Stochastic Petri Net
In concurrent real-time processes, the speed of individual components has a double impact: on the one hand, the overall latency of a compound process is affected by the latency of...
Anne Bouillard, Stefan Haar, Sidney Rosario
SARA
2009
Springer
16 years 1 months ago
Integrating Constraint Models for Sequential and Partial-Order Planning
Classical planning deals with finding a (shortest) sequence of actions transferring the world from its initial state to a state satisfying the goal condition. Traditional planning...
Roman Barták, Daniel Toropila
ICIP
2005
IEEE
16 years 4 days ago
Higher order polynomials, free form deformations and optical flow estimation
In this paper, we propose a novel technique to represent and recover optical flow through free form deformations. Such a technique is based on representing the motion field usin...
Konstantinos Karantzalos, Nikos Paragios