Sciweavers

8499 search results - page 1505 / 1700
» cans 2009
Sort
View
ICIP
2009
IEEE
15 years 4 months ago
Randomness-in-Structured Ensembles for compressed sensing of images
Leading compressed sensing (CS) methods require m = O (k log(n)) compressive samples to perfectly reconstruct a k-sparse signal x of size n using random projection matrices (e.g., ...
Abdolreza A. Moghadam, Hayder Radha
HPCA
2009
IEEE
16 years 7 months ago
Versatile prediction and fast estimation of Architectural Vulnerability Factor from processor performance metrics
The shrinking processor feature size, lower threshold voltage and increasing clock frequency make modern processors highly vulnerable to transient faults. Architectural Vulnerabil...
Lide Duan, Bin Li, Lu Peng
INFOCOM
2009
IEEE
16 years 1 months ago
On Leveraging Partial Paths in Partially-Connected Networks
Abstract—Mobile wireless network research focuses on scenarios at the extremes of the network connectivity continuum where the probability of all nodes being connected is either ...
Simon Heimlicher, Merkourios Karaliopoulos, Hanoch...
EDBT
2009
ACM
118views Database» more  EDBT 2009»
15 years 10 months ago
Flower-CDN: a hybrid P2P overlay for efficient query processing in CDN
Many websites with a large user base, e.g., websites of nonprofit organizations, do not have the financial means to install large web-servers or use specialized content distributi...
Manal El Dick, Esther Pacitti, Bettina Kemme
ATAL
2010
Springer
15 years 7 months ago
Using counterfactual regret minimization to create competitive multiplayer poker agents
Games are used to evaluate and advance Multiagent and Artificial Intelligence techniques. Most of these games are deterministic with perfect information (e.g. Chess and Checkers)....
Nicholas Abou Risk, Duane Szafron
« Prev « First page 1505 / 1700 Last » Next »