Sciweavers

1964 search results - page 341 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
ICDAR
2003
IEEE
15 years 7 months ago
Recognition of Folding Process from Origami Drill Books
This paper describes a framework to recognizing and recreating folding process of origami based on illustrations of origami drill books. Illustration images acquired from origami ...
Hiroshi Shimanuki, Jien Kato, Toyohide Watanabe
PAMI
2000
133views more  PAMI 2000»
15 years 1 months ago
Mode-Finding for Mixtures of Gaussian Distributions
I consider the problem of finding all the modes of a mixture of multivariate Gaussian distributions, which has applications in clustering and regression. I derive exact formulas f...
Miguel Á. Carreira-Perpiñán
APN
2005
Springer
15 years 7 months ago
Genetic Process Mining
The topic of process mining has attracted the attention of both researchers and tool vendors in the Business Process Management (BPM) space. The goal of process mining is to discov...
Wil M. P. van der Aalst, Ana Karla A. de Medeiros,...
JGAA
2007
124views more  JGAA 2007»
15 years 1 months ago
Simultaneous Border Segmentation of Doughnut-Shaped Objects in Medical Images
Image segmentation with specific constraints has found applications in several areas such as biomedical image analysis and data mining. In this paper, we study the problem of sim...
Xiaodong Wu, Michael B. Merickel
CC
2007
Springer
121views System Software» more  CC 2007»
15 years 1 months ago
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma