Sciweavers

1461 search results - page 276 / 293
» Complexity of Graph Covering Problems
Sort
View
JPDC
2010
137views more  JPDC 2010»
13 years 6 months ago
Parallel exact inference on the Cell Broadband Engine processor
—We present the design and implementation of a parallel exact inference algorithm on the Cell Broadband Engine (Cell BE). Exact inference is a key problem in exploring probabilis...
Yinglong Xia, Viktor K. Prasanna
PAMI
2010
174views more  PAMI 2010»
13 years 5 months ago
Image Segmentation with a Unified Graphical Model
—We propose a unified graphical model that can represent both the causal and noncausal relationships among random variables and apply it to the image segmentation problem. Specif...
Lei Zhang 0011, Qiang Ji
ACL
2010
13 years 5 months ago
Combining Orthogonal Monolingual and Multilingual Sources of Evidence for All Words WSD
Word Sense Disambiguation remains one of the most complex problems facing computational linguists to date. In this paper we present a system that combines evidence from a monoling...
Weiwei Guo, Mona Diab
FORMATS
2010
Springer
13 years 5 months ago
Expected Reachability-Time Games
In an expected reachability-time game (ERTG) two players, Min and Max, move a token along the transitions of a probabilistic timed automaton, so as to minimise and maximise, respec...
Vojtech Forejt, Marta Z. Kwiatkowska, Gethin Norma...
TCOM
2010
65views more  TCOM 2010»
13 years 2 months ago
Max-matching diversity in OFDMA systems
Abstract--This paper considers the problem of optimal subcarrier allocation in OFDMA systems to achieve the minimum outage probability while guaranteeing fairness. The optimal subc...
Bo Bai, Wei Chen, Zhigang Cao, Khaled Ben Letaief