Sciweavers

8825 search results - page 147 / 1765
» All for one or one for all
Sort
View
BPM
2009
Springer
138views Business» more  BPM 2009»
15 years 8 months ago
Graph Matching Algorithms for Business Process Model Similarity Search
We investigate the problem of ranking all process models in a repository according to their similarity with respect to a given process model. We focus specifically on the applicat...
Remco M. Dijkman, Marlon Dumas, Luciano Garc&iacut...
CSR
2009
Springer
15 years 8 months ago
Variations on Muchnik's Conditional Complexity Theorem
Muchnik’s theorem about simple conditional descriptions states that for all strings a and b there exists a short program p transforming a to b that has the least possible length ...
Daniil Musatov, Andrei E. Romashchenko, Alexander ...
EPIA
2009
Springer
15 years 8 months ago
Colored Nonograms: An Integer Linear Programming Approach
Abstract. In this paper we study colored nonogram solving using Integer Linear Programming. Our approach generalizes the one used by Robert A. Bosch which was developed for black a...
Luís Mingote, Francisco Azevedo
ICICS
2009
Springer
15 years 8 months ago
Biometric-Based Non-transferable Anonymous Credentials
This work explores the problem of using biometric data to achieve non-transferability of anonymous credentials; that is, sharing of anonymous credentials, which allow one to anonym...
Marina Blanton, William M. P. Hudelson
ISAAC
2009
Springer
82views Algorithms» more  ISAAC 2009»
15 years 8 months ago
Folding a Better Checkerboard
Abstract. Folding an n × n checkerboard pattern from a square of paper that is white on one side and black on the other has been thought for several years to require a paper squar...
Erik D. Demaine, Martin L. Demaine, Goran Konjevod...