Sciweavers

2512 search results - page 498 / 503
» Learning from Highly Structured Data by Decomposition
Sort
View
INFOCOM
2007
IEEE
15 years 4 months ago
Analysis of the Reliability of a Nationwide Short Message Service
—SMS has been arguably the most popular wireless data service for cellular networks. Due to its ubiquitous availability and universal support by mobile handsets and cellular carr...
Xiaoqiao Meng, Petros Zerfos, Vidyut Samanta, Star...
MICRO
2006
IEEE
145views Hardware» more  MICRO 2006»
15 years 3 months ago
Virtually Pipelined Network Memory
We introduce virtually-pipelined memory, an architectural technique that efficiently supports high-bandwidth, uniform latency memory accesses, and high-confidence throughput eve...
Banit Agrawal, Timothy Sherwood
ADBIS
2006
Springer
109views Database» more  ADBIS 2006»
15 years 3 months ago
Content Is Capricious: A Case for Dynamic System Generation
Abstract. Database modeling is based on the assumption of a high regularity of its application areas, an assumption which applies to both the structure of data and the behavior of ...
Hans-Werner Sehring, Sebastian Bossung, Joachim W....
SC
2009
ACM
15 years 2 months ago
GPU based sparse grid technique for solving multidimensional options pricing PDEs
It has been shown that the sparse grid combination technique can be a practical tool to solve high dimensional PDEs arising in multidimensional option pricing problems in finance...
Abhijeet Gaikwad, Ioane Muni Toke
ANCS
2006
ACM
15 years 1 months ago
Packet classification using coarse-grained tuple spaces
While the problem of high performance packet classification has received a great deal of attention in recent years, the research community has yet to develop algorithmic methods t...
Haoyu Song, Jonathan S. Turner, Sarang Dharmapurik...