Sciweavers

644 search results - page 34 / 129
» Decomposition Complexity
Sort
View
ENTCS
2006
173views more  ENTCS 2006»
15 years 17 days ago
Concurrent LSC Verification: On Decomposition Properties of Partially Ordered Symbolic Automata
Partially Ordered Symbolic Automata (POSAs) are used as the semantical foundation of visual formalisms like the scenario based language of Live Sequence Charts (LSCs). To check whe...
Tobe Toben, Bernd Westphal
CVPR
2011
IEEE
14 years 9 months ago
Multi-Level Inference by Relaxed Dual Decomposition for Human Pose Segmentation
Combining information from the higher level and the lower level has long been recognized as an essential component in holistic image understanding. However, an efficient inferenc...
Huayan Wang, Daphne Koller
ICASSP
2007
IEEE
15 years 7 months ago
Oversampled Inverse Complex Lapped Transform Optimization
When an oversampled FIR filter bank structure is used for signal analysis, a main problem is to guarantee its invertibility and to be able to determine an inverse synthesis filt...
Jérôme Gauthier, Laurent Duval, Jean-...
ANTS
2010
Springer
260views Algorithms» more  ANTS 2010»
15 years 4 months ago
On the Complexity of the Montes Ideal Factorization Algorithm
Let p be a rational prime and let Φ(X) be a monic irreducible polynomial in Z[X], with nΦ = deg Φ and δΦ = vp(disc Φ). In [13] Montes describes an algorithm for the decomposi...
David Ford, Olga Veres
72
Voted
DCG
2007
70views more  DCG 2007»
15 years 16 days ago
Fiber Fans and Toric Quotients
The GIT chamber decomposition arising from a subtorus action on a polarized quasiprojective toric variety is a polyhedral complex. Denote by Σ the fan that is the cone over the po...
Alastair Craw, Diane Maclagan