Sciweavers

1554 search results - page 28 / 311
» Parameterized Complexity and Approximation Algorithms
Sort
View
148
Voted
CAD
2005
Springer
15 years 2 months ago
Parameterization and parametric design of mannequins
This paper presents a novel feature based parameterization approach of human bodies from the unorganized cloud points and the parametric design method for generating new models ba...
Charlie C. L. Wang
102
Voted
DAC
2008
ACM
16 years 3 months ago
Parameterized timing analysis with general delay models and arbitrary variation sources
Many recent techniques for timing analysis under variability, in which delay is an explicit function of underlying parameters, may be described as parameterized timing analysis. T...
Khaled R. Heloue, Farid N. Najm
116
Voted
LATIN
2000
Springer
15 years 6 months ago
Worst-Case Complexity of the Optimal LLL Algorithm
In this paper, we consider the open problem of the complexity of the LLL algorithm in the case when the approximation parameter of the algorithm has its extreme value
Ali Akhavi
130
Voted
SACMAT
2009
ACM
15 years 9 months ago
Symbolic reachability analysis for parameterized administrative role based access control
Role based access control (RBAC) is a widely used access control paradigm. In large organizations, the RBAC policy is managed by multiple administrators. An administrative role ba...
Scott D. Stoller, Ping Yang, Mikhail I. Gofman, C....
132
Voted
AAIM
2006
Springer
75views Algorithms» more  AAIM 2006»
15 years 8 months ago
Subsequence Packing: Complexity, Approximation, and Application
We study the subsequence packing problem: given a string T and a collection of strings {Si}, find disjoint subsequences {Ti} of T with maximum total length such that each Ti is a ...
Minghui Jiang