Sciweavers

314 search results - page 51 / 63
» A Comparison of Known Codes, Random Codes, and the Best Code...
Sort
View
PPOPP
2010
ACM
14 years 4 months ago
Leveraging parallel nesting in transactional memory
Exploiting the emerging reality of affordable multi-core architeces through providing programmers with simple abstractions that would enable them to easily turn their sequential p...
João Barreto, Aleksandar Dragojevic, Paulo ...
HPDC
2010
IEEE
13 years 8 months ago
Massive Semantic Web data compression with MapReduce
The Semantic Web consists of many billions of statements made of terms that are either URIs or literals. Since these terms usually consist of long sequences of characters, an effe...
Jacopo Urbani, Jason Maassen, Henri E. Bal
CISS
2010
IEEE
12 years 11 months ago
On Gaussian MIMO compound wiretap channels
— We study the two-user one-eavesdropper discrete memoryless compound wiretap channel, where the transmitter sends a common confidential message to both users, which needs to be...
Ersen Ekrem, Sennur Ulukus
SDM
2011
SIAM
242views Data Mining» more  SDM 2011»
12 years 10 months ago
Fast Algorithms for Finding Extremal Sets
Identifying the extremal (minimal and maximal) sets from a collection of sets is an important subproblem in the areas of data-mining and satisfiability checking. For example, ext...
Roberto J. Bayardo, Biswanath Panda
GLVLSI
2009
IEEE
186views VLSI» more  GLVLSI 2009»
14 years 2 months ago
Bitmask-based control word compression for NISC architectures
Implementing a custom hardware is not always feasible due to cost and time considerations. No instruction set computer (NISC) architecture is one of the promising direction to des...
Chetan Murthy, Prabhat Mishra