Sciweavers

1096 search results - page 9 / 220
» A New Approach for Speeding Up Enumeration Algorithms
Sort
View
ISPAN
2009
IEEE
15 years 4 months ago
High Speed Articulated Object Tracking Using GPUs: A Particle Filter Approach
—This paper presents a novel application of the GPU processing power to a very computationally demanding articulated human body tracking problem in a view-based approach. This wo...
Raúl Cabido, David Concha, Juan José...
LPAR
2010
Springer
14 years 7 months ago
Counting and Enumeration Problems with Bounded Treewidth
By Courcelle's Theorem we know that any property of finite structures definable in monadic second-order logic (MSO) becomes tractable over structures with bounded treewidth. T...
Reinhard Pichler, Stefan Rümmele, Stefan Wolt...
CPAIOR
2009
Springer
15 years 4 months ago
Solution Enumeration for Projected Boolean Search Problems
Many real-world problems require the enumeration of all solutions of combinatorial search problems, even though this is often infeasible in practice. However, not always all parts ...
Martin Gebser, Benjamin Kaufmann, Torsten Schaub
SDM
2009
SIAM
176views Data Mining» more  SDM 2009»
15 years 7 months ago
Constraint-Based Subspace Clustering.
In high dimensional data, the general performance of traditional clustering algorithms decreases. This is partly because the similarity criterion used by these algorithms becomes ...
Élisa Fromont, Adriana Prado, Céline...
KDD
2004
ACM
207views Data Mining» more  KDD 2004»
15 years 10 months ago
SPIN: mining maximal frequent subgraphs from graph databases
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...
Jun Huan, Wei Wang 0010, Jan Prins, Jiong Yang