Sciweavers

250 search results - page 9 / 50
» Fixed Argument Pairings
Sort
View
JAIR
2006
143views more  JAIR 2006»
13 years 9 months ago
Convexity Arguments for Efficient Minimization of the Bethe and Kikuchi Free Energies
Loopy and generalized belief propagation are popular algorithms for approximate inference in Markov random fields and Bayesian networks. Fixed points of these algorithms have been...
Tom Heskes
EMNLP
2009
13 years 7 months ago
Recognizing Textual Relatedness with Predicate-Argument Structures
In this paper, we first compare several strategies to handle the newly proposed three-way Recognizing Textual Entailment (RTE) task. Then we define a new measurement for a pair of...
Rui Wang 0005, Yi Zhang 0003
ESA
2009
Springer
129views Algorithms» more  ESA 2009»
14 years 4 months ago
Constant Ratio Fixed-Parameter Approximation of the Edge Multicut Problem
Abstract. The input of the Edge Multicut problem consists of an undirected graph G and pairs of terminals {s1, t1}, . . . , {sm, tm}; the task is to remove a minimum set of edges s...
Dániel Marx, Igor Razgon
PROVSEC
2009
Springer
14 years 4 months ago
Breaking and Fixing of an Identity Based Multi-Signcryption Scheme
Signcryption is a cryptographic primitive that provides authentication and confidentiality simultaneously in a single logical step. It is often required that multiple senders have...
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Ra...
PIMRC
2008
IEEE
14 years 4 months ago
Adaptive radio resource management for a cellular system with fixed relay nodes
— Future mobile communications systems demand for higher data rates and service quality compared to state-of-the-art systems. One way to achieve this ambitious goal is to use rel...
Fredrik Boye, Peter Rost, Gerhard Fettweis