Sciweavers

1579 search results - page 236 / 316
» On the Constructions of Constant-Weight Codes
Sort
View
SPAA
1997
ACM
15 years 10 months ago
Pipelining with Futures
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...
Guy E. Blelloch, Margaret Reid-Miller
PLDI
1990
ACM
15 years 10 months ago
A Fresh Look at Optimizing Array Bound Checking
- This paper describes techniques for optimizing range checks performed to detect array bound violations. In addition to the elimination of range check:s, the optimizations discuss...
Rajiv Gupta
AOSD
2007
ACM
15 years 10 months ago
An aspect-oriented approach to bypassing middleware layers
The layered architecture of middleware platforms (such as CORBA, SOAP, J2EE) is a mixed blessing. On the one hand, layers provide services such as demarshaling, session management...
Ömer Erdem Demir, Premkumar T. Devanbu, Eric ...
DATE
2004
IEEE
175views Hardware» more  DATE 2004»
15 years 10 months ago
Breaking Instance-Independent Symmetries in Exact Graph Coloring
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
Arathi Ramani, Fadi A. Aloul, Igor L. Markov, Kare...
INFOCOM
1989
IEEE
15 years 9 months ago
An Efficient Multiple-Access Method for the Binary Adder Channel
Consider M - HChoose P - T communications: T users or less, out of M potential users, are chosen at random to simultaneously transmit binary data over a common channel. A method f...
Israel Bar-David, Eli Plotnik, Raphael Rom