Sciweavers

877 search results - page 26 / 176
» How to Cover a Grammar
Sort
View
ICIP
2006
IEEE
14 years 9 months ago
Cover Selection for Steganographic Embedding
The primary goal of image steganography techniques has been to maximize embedding rate while minimizing the detectability of the resulting stego images against steganalysis techni...
Mehdi Kharrazi, Taha Taha Sencar, Nasir D. Memon
ECEASST
2006
103views more  ECEASST 2006»
13 years 7 months ago
Petri Nets and Matrix Graph Grammars: Reachability
This paper contributes in two directions. First, several concepts of our matrix approach to graph transformation [1,2] such as coherence and minimal initial digraph are applied to ...
Juan de Lara, Pedro Pablo Pérez Velasco
AGTIVE
2007
Springer
13 years 11 months ago
Verification and Synthesis of OCL Constraints Via Topology Analysis
On the basis of a case-study, we demonstrate the usefulness of topology invariants for model-driven systems development. Considering a graph grammar semantics for a relevant fragme...
Jörg Bauer, Werner Damm, Tobe Toben, Bernd We...
HRI
2010
ACM
14 years 1 months ago
Judging a bot by its cover: an experiment on expectation setting for personal robots
—Managing user expectations of personal robots becomes particularly challenging when the end-user just wants to know what the robot can do, and neither understands nor cares abou...
Steffi Paepcke, Leila Takayama
WEA
2010
Springer
250views Algorithms» more  WEA 2010»
14 years 16 days ago
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...
Benjamin Doerr, Marvin Künnemann, Magnus Wahl...