Sciweavers

5331 search results - page 20 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
IPL
2006
118views more  IPL 2006»
13 years 8 months ago
Easy intruder deduction problems with homomorphisms
We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebr...
Stéphanie Delaune
TSP
2008
114views more  TSP 2008»
13 years 8 months ago
Zero-Forcing Precoding and Generalized Inverses
Abstract--We consider the problem of linear zero-forcing precoding design and discuss its relation to the theory of generalized inverses in linear algebra. Special attention is giv...
Ami Wiesel, Yonina C. Eldar, Shlomo Shamai
MICAI
2007
Springer
14 years 2 months ago
Optimizing Inference in Bayesian Networks and Semiring Valuation Algebras
Previous work on context-specific independence in Bayesian networks is driven by a common goal, namely to represent the conditional probability tables in a most compact way. In th...
Michael Wachter, Rolf Haenni, Marc Pouly
WISE
2002
Springer
14 years 1 months ago
Optimized Translation of XPath into Algebraic Expressions Parameterized by Programs Containing Navigational Primitives
We propose a new approach for the efficient evaluation of XPath expressions. This is important, since XPath is not only used as a simple, stand-alone query language, but is also ...
Sven Helmer, Carl-Christian Kanne, Guido Moerkotte
CDC
2008
IEEE
129views Control Systems» more  CDC 2008»
14 years 3 months ago
On the structure of graph edge designs that optimize the algebraic connectivity
— We take a structural approach to the problem of designing the edge weights in an undirected graph subject to an upper bound on their total, so as to maximize the algebraic conn...
Yan Wan, Sandip Roy, Xu Wang, Ali Saberi, Tao Yang...