Sciweavers

4074 search results - page 683 / 815
» Defining Computational Aesthetics
Sort
View
164
Voted
CONSTRAINTS
2010
110views more  CONSTRAINTS 2010»
15 years 1 months ago
Solving subgraph isomorphism problems with constraint programming
The subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a global constraint and an associated ...
Stéphane Zampelli, Yves Deville, Christine ...
CORR
2010
Springer
98views Education» more  CORR 2010»
15 years 1 months ago
Coding for High-Density Recording on a 1-D Granular Magnetic Medium
In terabit-density magnetic recording, several bits of data can be replaced by the values of their neighbors in the storage medium. As a result, errors in the medium are dependent ...
Arya Mazumdar, Alexander Barg, Navin Kashyap
142
Voted
DMTCS
2010
137views Mathematics» more  DMTCS 2010»
15 years 1 months ago
Deterministic recognizability of picture languages with Wang automata
We present a model of automaton for picture language recognition, called Wang automaton, which is based on labeled Wang tiles. Wang automata combine features of both online tessell...
Violetta Lonati, Matteo Pradella
144
Voted
FAC
2010
140views more  FAC 2010»
15 years 1 months ago
From a domain analysis to the specification and detection of code and design smells
Code and design smells are recurring design problems in software systems that must be identified to avoid their possible negative consequences on development and maintenance. Conse...
Naouel Moha, Yann-Gaël Guéhéneu...
155
Voted
FCSC
2010
170views more  FCSC 2010»
15 years 1 months ago
Formal verification of concurrent programs with read-write locks
Abstract Read-write locking is an important mechanism to improve concurrent granularity, but it is difficult to reason about the safety of concurrent programs with read-write locks...
Ming Fu, Yu Zhang, Yong Li