Sciweavers

13603 search results - page 87 / 2721
» On the Complexity of Computing Treelength
Sort
View
IWPC
2010
IEEE
13 years 7 months ago
A Simple and Effective Measure for Complex Low-Level Dependencies
The measure dep-degree is a simple indicator for structural problems and complex dependencies on code-level. We model low-level dependencies between program operations as use-def ...
Dirk Beyer, Ashgan Fararooy
JAPLL
2010
133views more  JAPLL 2010»
13 years 7 months ago
Complexity of modal logics with Presburger constraints
We introduce the extended modal logic EML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as nu...
Stéphane Demri, Denis Lugiez
ECAI
2010
Springer
13 years 7 months ago
Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics
We investigate the complexity of axiom pinpointing for different members of the DL-Lite family of Description Logics. More precisely, we consider the problem of enumerating all mi...
Rafael Peñaloza, Baris Sertkaya
PCM
2010
Springer
239views Multimedia» more  PCM 2010»
13 years 7 months ago
Adaptive Particle Filter Based on Energy Field for Robust Object Tracking in Complex Scenes
Particle filter (PF) based object tracking methods have been widely used in computer vision. However, traditional particle filter trackers cannot effectively distinguish the target...
Xin Sun, Hongxun Yao, Shengping Zhang, Shaohui Liu
TWC
2010
13 years 3 months ago
A Reduced-Complexity PTS-Based PAPR Reduction Scheme for OFDM Systems
In this paper, a reduced-complexity partial transmit sequences (PTS) scheme is proposed to resolve the intrinsic high peak-to-average power ratio (PAPR) problem of orthogonal frequ...
Sheng-Ju Ku, Chin-Liang Wang, Chiuan-Hsu Chen