Sciweavers

639 search results - page 110 / 128
» A Finite State Mobile Agent Computation Model
Sort
View
ECCV
2006
Springer
15 years 11 months ago
Efficient Belief Propagation with Learned Higher-Order Markov Random Fields
Belief propagation (BP) has become widely used for low-level vision problems and various inference techniques have been proposed for loopy graphs. These methods typically rely on a...
Xiangyang Lan, Stefan Roth, Daniel P. Huttenlocher...
FOSSACS
2010
Springer
15 years 4 months ago
The Complexity of Synchronous Notions of Information Flow Security
The paper considers the complexity of verifying that a finite state system satisfies a number of definitions of information flow security. The systems model considered is one i...
Franck Cassez, Ron van der Meyden, Chenyi Zhang
BIRTHDAY
2010
Springer
14 years 10 months ago
Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
Martin Grohe
JSAC
2008
90views more  JSAC 2008»
14 years 9 months ago
Limited feedback schemes for downlink OFDMA based on sub-channel groups
Abstract--In a downlink Orthogonal Frequency Division Multiple Access (OFDMA) system, optimally allocating sub-channels across mobile users can require excessive feedback of channe...
Jieying Chen, Randall A. Berry, Michael L. Honig
LICS
2007
IEEE
15 years 3 months ago
First-Order and Temporal Logics for Nested Words
Nested words are a structured model of execution paths in procedural programs, reflecting their call and return nesting structure. Finite nested words also capture the structure ...
Rajeev Alur, Marcelo Arenas, Pablo Barceló,...