Sciweavers

1193 search results - page 76 / 239
» A primer of simple theories
Sort
View
FUN
2010
Springer
251views Algorithms» more  FUN 2010»
15 years 4 months ago
UNO Is Hard, Even for a Single Player
UNOR is one of the world-wide well-known and popular card games. We investigate UNO from the viewpoint of combinatorial algorithmic game theory by giving some simple and concise ma...
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara,...
78
Voted
PCM
2001
Springer
112views Multimedia» more  PCM 2001»
15 years 4 months ago
Correlation Detection of Asymmetric Watermark
Abstract. This paper proposes a novel method to detect Furon’s asymmetric watermark by using a correlation detector that is mathematically tractable and simple. The performance o...
Jin S. Seo, Chang D. Yoo
SRDS
1998
IEEE
15 years 4 months ago
Practical Parallel Algorithms for Minimum Spanning Trees
We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p...
Frank K. H. A. Dehne, Silvia Götz
EP
1998
Springer
15 years 4 months ago
Mathematical Tools for Computer-Generated Ornamental Patterns
This article presents mathematical tools for computer-generated ornamental patterns, with a particular attention payed to Islamic patterns. The article shows how, starting from a p...
Victor Ostromoukhov
BPM
2003
Springer
123views Business» more  BPM 2003»
15 years 3 months ago
A Top-Down Petri Net-Based Approach for Dynamic Workflow Modeling
A top-down approach for workflow design is proposed in the framework of Petri net theory. Simple but powerful refinement rules are proposed that guarantee soundness of the resultin...
Piotr Chrzastowski-Wachtel, Boualem Benatallah, Ra...