Sciweavers

4860 search results - page 382 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
109
Voted
CAINE
2008
15 years 5 months ago
Matching 2D Fragments of Objects
This paper describes an algorithm that pieces together 2D fragments of an object. Matching fragments of an object is useful for solving puzzles or reassembling archaeological frag...
Catherine Stringfellow, Richard Simpson, H. Bui, Y...
107
Voted
FSTTCS
2008
Springer
15 years 4 months ago
Explicit Muller Games are PTIME
Regular games provide a very useful model for the synthesis of controllers in reactive systems. The complexity of these games depends on the representation of the winning condition...
Florian Horn
137
Voted
ATAL
2008
Springer
15 years 5 months ago
Coalitional skill games
We consider Coalitional Skill Games (CSGs), a simple model of cooperation among agents. This is a restricted form of coalitional games, where each agent has a set of skills that a...
Yoram Bachrach, Jeffrey S. Rosenschein
350
Voted
ICA
2012
Springer
13 years 11 months ago
On Revealing Replicating Structures in Multiway Data: A Novel Tensor Decomposition Approach
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...
Anh Huy Phan, Andrzej Cichocki, Petr Tichavsk&yacu...
165
Voted
ICDT
2012
ACM
251views Database» more  ICDT 2012»
13 years 6 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich