Sciweavers

2266 search results - page 9 / 454
» Generalizing parametric timing analysis
Sort
View
NJC
1998
86views more  NJC 1998»
13 years 7 months ago
Parametric Permutation Routing via Matchings
The problem of routing permutations on graphs via matchings is considered, and we present a general algorithm which can be parameterized by different heuristics. This leads to a ...
Peter Høyer, Kim S. Larsen
IWMM
2010
Springer
140views Hardware» more  IWMM 2010»
13 years 9 months ago
Parametric inference of memory requirements for garbage collected languages
The accurate prediction of program's memory requirements is a critical component in software development. Existing heap space analyses either do not take deallocation into ac...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...
CVPR
2008
IEEE
14 years 9 months ago
Robust unambiguous parametrization of the essential manifold
Analytic manifolds were recently used for motion averaging, segmentation and robust estimation. Here we consider the epipolar constraint for calibrated cameras, which is the most ...
Raghav Subbarao, Yakup Genc, Peter Meer
ICONIP
2004
13 years 9 months ago
Generalization in Learning Multiple Temporal Patterns Using RNNPB
Abstract. This paper examines the generalization capability in learning multiple temporal patterns by the recurrent neural network with parametric bias (RNNPB). Our simulation expe...
Masato Ito, Jun Tani
STACS
2010
Springer
14 years 2 months ago
Two-phase Algorithms for the Parametric Shortest Path Problem
Abstract. A parametric weighted graph is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obta...
Sourav Chakraborty, Eldar Fischer, Oded Lachish, R...