Sciweavers

5592 search results - page 207 / 1119
» On Random Betweenness Constraints
Sort
View
ECCV
2006
Springer
16 years 8 months ago
A Comparative Study of Energy Minimization Methods for Markov Random Fields
One of the most exciting advances in early vision has been the development of efficient energy minimization algorithms. Many early vision tasks require labeling each pixel with som...
Richard Szeliski, Ramin Zabih, Daniel Scharstein, ...
187
Voted
VTC
2008
IEEE
156views Communications» more  VTC 2008»
16 years 16 days ago
Channel Asymmetry and Random Time Slot Hopping in OFDMA-TDD Cellular Networks
Abstract—This paper studies the performance of orthogonal frequency division multiple access – time division duplex (OFDMA-TDD) cellular networks when jointly applying dynamic ...
Ellina Foutekova, Patrick Agyapong, Harald Haas
CVPR
2010
IEEE
15 years 11 months ago
A Novel Markov Random Field Based Deformable Model for Face Recognition
In this paper, a new scheme to address the face recognition problem is proposed. Different from traditional face recognition approaches which represent each facial image by a sing...
Shu Liao, Albert C.S. Chung
IPPS
1998
IEEE
15 years 10 months ago
Randomization in Parallel Stringology
In this abstract, we provide an overview of our survey of randomized techniques for exploiting the parallelism in string matching problems. Broadly, the study of string matching fa...
S. Muthukrishnan
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
15 years 10 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...