Sciweavers

1763 search results - page 57 / 353
» Dependent random choice
Sort
View
COMBINATORICA
2011
12 years 9 months ago
On the chromatic number of random geometric graphs
Given independent random points X1, . . . , Xn ∈ Rd with common probability distribution ν, and a positive distance r = r(n) > 0, we construct a random geometric graph Gn wi...
Colin McDiarmid, Tobias Müller
ECCV
2006
Springer
14 years 11 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, ...
WCNC
2008
IEEE
14 years 3 months ago
Selective Relaying in Cooperative OFDM Systems: Two-Hop Random Network
— In this paper, we investigate two selective relaying schemes in cooperative OFDM systems. Selective OFDMA relaying, where the relay selection is performed in a per-subcarrier m...
Bo Gui, Lin Dai, Leonard J. Cimini Jr.
ITS
2010
Springer
178views Multimedia» more  ITS 2010»
14 years 1 months ago
Learning What Works in ITS from Non-traditional Randomized Controlled Trial Data
The traditional, well established approach to finding out what works in education research is to run a randomized controlled trial (RCT) using a standard pretest and posttest desig...
Zachary A. Pardos, Matthew D. Dailey, Neil T. Heff...
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 9 months ago
Dependability in Aggregation by Averaging
Abstract. Aggregation is an important building block of modern distributed applications, allowing the determination of meaningful properties (e.g. network size, total storage capac...
Paulo Jesus, Carlos Baquero, Paulo Sérgio A...