Sciweavers

2657 search results - page 243 / 532
» On the complexity of hierarchical problem solving
Sort
View
FIMI
2003
84views Data Mining» more  FIMI 2003»
15 years 3 months ago
Detailed Description of an Algorithm for Enumeration of Maximal Frequent Sets with Irredundant Dualization
We describe an implementation of an algorithm for enumerating all maximal frequent sets using irredundant dualization, which is an improved version of that of Gunopulos et al. The...
Takeaki Uno, Ken Satoh
NIPS
2004
15 years 3 months ago
Comparing Beliefs, Surveys, and Random Walks
Survey propagation is a powerful technique from statistical physics that has been applied to solve the 3-SAT problem both in principle and in practice. We give, using only probabi...
Erik Aurell, Uri Gordon, Scott Kirkpatrick
WSCG
2004
216views more  WSCG 2004»
15 years 3 months ago
A Fast and Accurate Faces Localization using Gradient Method
Detecting faces in images with complex background is a difficult task. To solve this problem we decided to use modified gradient method with oval object detection. This method is ...
Georgy Kukharev, Pawel Masicz, Piotr Masicz
AAI
2006
71views more  AAI 2006»
15 years 2 months ago
Textual Article Clustering in Newspaper Pages
In the analysis of a newspaper page an important step is the clustering of various text blocks into logical units, i.e., into articles. We propose three algorithms based on text p...
Marco Aiello, Andrea Pegoretti
IJHPCA
2006
73views more  IJHPCA 2006»
15 years 1 months ago
The Tau Parallel Performance System
The ability of performance technology to keep pace with the growing complexity of parallel and distributed systems depends on robust performance frameworks that can at once provid...
Sameer Shende, Allen D. Malony