Sciweavers

3934 search results - page 511 / 787
» Approximate Schedulability Analysis
Sort
View
IWDW
2005
Springer
16 years 5 days ago
On the Achievable Rate of Side Informed Embedding Techniques with Steganographic Constraints
The development of watermarking schemes in the literature is generally guided by a power constraint on the watermark to be embedded into the host. In a steganographic framework the...
Mark T. Hogan, Félix Balado, Neil J. Hurley...
TACAS
1997
Springer
197views Algorithms» more  TACAS 1997»
15 years 10 months ago
Design/CPN - A Computer Tool for Coloured Petri Nets
In this paper, we describe the computer tool Design CPN supporting editing, simulation, and state space analysis of Coloured Petri Nets. So far, approximately 40 man-years have bee...
Søren Christensen, Jens Bæk Jø...
COMPGEOM
2008
ACM
15 years 8 months ago
Tighter bounds for random projections of manifolds
The Johnson-Lindenstrauss random projection lemma gives a simple way to reduce the dimensionality of a set of points while approximately preserving their pairwise distances. The m...
Kenneth L. Clarkson
MVA
2007
110views Computer Vision» more  MVA 2007»
15 years 8 months ago
Propagation of Uncertainty in Landmark Based Self-localization of Autonomous Mobile Robots
This paper presents uncertainty propagation in landmark based position estimation methods. Analysis of two methods has been carried out where robot position is estimated by detect...
Abdul Bais, Robert Sablatnig, Yahya M. Khawaja, Gr...
NIPS
2004
15 years 8 months ago
Following Curved Regularized Optimization Solution Paths
Regularization plays a central role in the analysis of modern data, where non-regularized fitting is likely to lead to over-fitted models, useless for both prediction and interpre...
Saharon Rosset