Sciweavers

2272 search results - page 1 / 455
» Capture Complexity by Partition
Sort
View
CSL
2001
Springer
13 years 9 months ago
Capture Complexity by Partition
We show in this paper a special extended logic, partition logic based on so called partition quantifiers, is able to capture some important complexity classes NP, P and NL by its ...
Yijia Chen, Enshao Shen
CVPR
2001
IEEE
14 years 6 months ago
Automatic Partitioning of High Dimensional Search Spaces Associated with Articulated Body Motion Capture
Particle filters have proven to be an effective tool for visual tracking in non-gaussian, cluttered environments. Conventional particle filters however do not scale to the problem...
Jonathan Deutscher, Andrew J. Davison, Ian D. Reid
DATE
2004
IEEE
114views Hardware» more  DATE 2004»
13 years 8 months ago
Power Aware Variable Partitioning and Instruction Scheduling for Multiple Memory Banks
Many high-end DSP processors employ both multiple memory banks and heterogeneous register files to improve performance and power consumption. The complexity of such architectures ...
Zhong Wang, Xiaobo Sharon Hu
HPCC
2007
Springer
13 years 11 months ago
Towards a Complexity Model for Design and Analysis of PGAS-Based Algorithms
Many new Partitioned Global Address Space (PGAS) programming languages have recently emerged and are becoming ubiquitously available on nearly all modern parallel architectures. PG...
Mohamed Bakhouya, Jaafar Gaber, Tarek A. El-Ghazaw...
PKDD
2007
Springer
109views Data Mining» more  PKDD 2007»
13 years 11 months ago
Matching Partitions over Time to Reliably Capture Local Clusters in Noisy Domains
Abstract. When seeking for small clusters it is very intricate to distinguish between incidental agglomeration of noisy points and true local patterns. We present the PAMALOC algor...
Frank Höppner, Mirko Böttcher