Sciweavers

2403 search results - page 279 / 481
» Optimal Randomized RANSAC
Sort
View
123
Voted
TWC
2008
108views more  TWC 2008»
15 years 3 months ago
Successive-Capture Analysis of RTS/CTS in Ad-Hoc Networks
We consider a wireless ad-hoc network with random ALOHA transmissions between nodes. However nodes can decide to use the Request-to-Send (RTS) / Clear-to-Send (CTS) protocol for oc...
Chin Keong Ho, Jean-Paul M. G. Linnartz
149
Voted
TOMACS
2002
113views more  TOMACS 2002»
15 years 3 months ago
Simulating heavy tailed processes using delayed hazard rate twisting
Consider the problem of estimating the small probability that the maximum of a random walk exceeds a large threshold, when the process has a negative drift and the underlying rand...
Sandeep Juneja, Perwez Shahabuddin
131
Voted
FOCM
2010
140views more  FOCM 2010»
15 years 2 months ago
Combinatorial Sublinear-Time Fourier Algorithms
We study the problem of estimating the best k term Fourier representation for a given frequency-sparse signal (i.e., vector) A of length N k. More explicitly, we investigate how t...
Mark A. Iwen
111
Voted
JPDC
2010
65views more  JPDC 2010»
15 years 2 months ago
Combining shared-coin algorithms
This paper shows that shared coin algorithms can be combined to optimize several complexity measures, even in the presence of a strong adversary. By combining shared coins of Brac...
James Aspnes, Hagit Attiya, Keren Censor
152
Voted
TCOM
2010
167views more  TCOM 2010»
15 years 2 months ago
On distributed scheduling in wireless networks exploiting broadcast and network coding
—In this paper, we consider cross-layer optimization in wireless networks with wireless broadcast advantage, focusing on the problem of distributed scheduling of broadcast links....
Tao Cui, Lijun Chen, Tracey Ho