Sciweavers

492 search results - page 31 / 99
» The number of possibilities for random dating
Sort
View
INFOCOM
2006
IEEE
14 years 2 months ago
Optimal Hopping in Ad Hoc Wireless Networks
— Gupta and Kumar showed that throughput in a static random wireless network increases with the amount of hopping. In a subsequent paper (2004), it was shown that although throug...
Abbas El Gamal, James P. Mammen
JC
2007
119views more  JC 2007»
13 years 8 months ago
Deterministic constructions of compressed sensing matrices
Compressed sensing is a new area of signal processing. Its goal is to minimize the number of samples that need to be taken from a signal for faithful reconstruction. The performan...
Ronald A. DeVore
IVC
2000
113views more  IVC 2000»
13 years 8 months ago
Matching disparate views of planar surfaces using projective invariants
Feature matching is a prerequisite to a wide variety of vision tasks. This paper presents a method that addresses the problem of matching disparate views of coplanar points and li...
Manolis I. A. Lourakis, Spyros T. Halkidis, Stelio...
CDC
2010
IEEE
102views Control Systems» more  CDC 2010»
13 years 3 months ago
Stock market trading via stochastic network optimization
We consider the problem of dynamic buying and selling of shares from a collection of N stocks with random price fluctuations. To limit investment risk, we place an upper bound on t...
Michael J. Neely
DATE
2010
IEEE
160views Hardware» more  DATE 2010»
14 years 1 months ago
Soft error-aware design optimization of low power and time-constrained embedded systems
— In this paper, we examine the impact of application task mapping on the reliability of MPSoC in the presence of single-event upsets (SEUs). We propose a novel soft erroraware d...
Rishad A. Shafik, Bashir M. Al-Hashimi, Krishnendu...