2484 search results - page 352 / 497 » Polymatroids with Network Coding |
SIGSOFT
2007
ACM
14 years 8 months ago
2007
ACM
Asynchronous systems components are hard to write, hard to reason about, and (not coincidentally) hard to mechanically verify. In order to achieve high performance, asynchronous c...
EUROSYS
2010
ACM
14 years 5 months ago
2010
ACM
Modern Byzantine fault-tolerant state machine replication (BFT) protocols involve about 20.000 lines of challenging C++ code encompassing synchronization, networking and cryptogra...
CODES
2007
IEEE
14 years 2 months ago
2007
IEEE
We address the problem of instruction selection for Multi-Output Instructions (MOIs), producing more than one result. Such inherently parallel hardware instructions are very commo...
HOTOS
1997
IEEE
14 years 10 days ago
1997
IEEE
To an unappreciated degree, research both in operating systems andtheirprogramminglanguageshasbeen severely hampered by the lack of cleanly reusable code providing mundanelow-leve...
SIGIR
1992
ACM
14 years 5 days ago
1992
ACM
ct tasks such as extraction of relational information from text [Young] [Jacobs]. We describe a method for classifying news stories using Alternative systems [Biebricher] [Lewis] u...