Sciweavers

315 search results - page 47 / 63
» What is algebraic in process theory
Sort
View
SPAA
2004
ACM
14 years 2 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
JAIR
2008
104views more  JAIR 2008»
13 years 9 months ago
On the Qualitative Comparison of Decisions Having Positive and Negative Features
Making a decision is often a matter of listing and comparing positive and negative arguments. In such cases, the evaluation scale for decisions should be considered bipolar, that ...
Didier Dubois, Hélène Fargier, Jean-...
ICEIS
2007
IEEE
14 years 3 months ago
Opting for Innovation in Mobile Applications
In this paper we are concerned with innovation in the development of mobile applications. In particular, we address how we may come to think systematically about innovative aspects...
Jens Henrik Hosbond, Peter Axel Nielsen, Ivan Aaen
MMSEC
2006
ACM
148views Multimedia» more  MMSEC 2006»
14 years 3 months ago
Minimizing the embedding impact in steganography
In this paper, we study the trade-off in steganography between the number of embedding changes and their amplitude. We assume that each element of the cover image is assigned a sc...
Jessica J. Fridrich
GECCO
2007
Springer
151views Optimization» more  GECCO 2007»
14 years 3 months ago
A building-block royal road where crossover is provably essential
One of the most controversial yet enduring hypotheses about what genetic algorithms (GAs) are good for concerns the idea that GAs process building-blocks. More specifically, it ha...
Richard A. Watson, Thomas Jansen