Sciweavers

6110 search results - page 1131 / 1222
» Approximate Computing
Sort
View
NETCOOP
2009
Springer
16 years 23 days ago
Optimal File Splitting for Wireless Networks with Concurrent Access
The fundamental limits on channel capacity form a barrier to the sustained growth on the use of wireless networks. To cope with this, multi-path communication solutions provide a p...
Gerard Hoekstra, Rob van der Mei, Yoni Nazarathy, ...
IMC
2009
ACM
16 years 22 days ago
Scalable proximity estimation and link prediction in online social networks
Proximity measures quantify the closeness or similarity between nodes in a social network and form the basis of a range of applications in social sciences, business, information t...
Han Hee Song, Tae Won Cho, Vacha Dave, Yin Zhang, ...
GLVLSI
2008
IEEE
147views VLSI» more  GLVLSI 2008»
16 years 20 days ago
Statistical timing analysis of flip-flops considering codependent setup and hold times
Statistical static timing analysis (SSTA) plays a key role in determining performance of the VLSI circuits implemented in state-of-the-art CMOS technology. A pre-requisite for emp...
Safar Hatami, Hamed Abrishami, Massoud Pedram
IPPS
2008
IEEE
16 years 18 days ago
Data throttling for data-intensive workflows
— Existing workflow systems attempt to achieve high performance by intelligently scheduling tasks on resources, sometimes even attempting to move the largest data files on the hi...
Sang-Min Park, Marty Humphrey
IPPS
2008
IEEE
16 years 18 days ago
SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
David A. Bader, Kamesh Madduri
« Prev « First page 1131 / 1222 Last » Next »