Sciweavers

675 search results - page 58 / 135
» Using Fairness to Make Abstractions Work
Sort
View
WDAG
2001
Springer
131views Algorithms» more  WDAG 2001»
15 years 8 months ago
The Complexity of Synchronous Iterative Do-All with Crashes
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
Chryssis Georgiou, Alexander Russell, Alexander A....
OTM
2004
Springer
15 years 9 months ago
Engineering an Ontology of Financial Securities Fraud
Abstract. This paper discusses the approach of ontology-based knowledge engineering in FF POIROT, a project to explore the use of ontology technology in information systems against...
Gang Zhao, John Kingston, Koen Kerremans, Frederic...
EWSPT
1998
Springer
15 years 8 months ago
Programming Process Coordination in Little-JIL
Abstract. Process programming languages have not been readily adopted by practitioners. We are addressing this problem through the development of Little-JIL, a language that focuse...
Barbara Staudt Lerner, Leon J. Osterweil, Stanley ...
115
Voted
PIMRC
2008
IEEE
15 years 10 months ago
Real vs. complex BPSK precoding for MIMO broadcast channels
Abstract—Recently M¨uller et al. (IEEE J. Select. Areas Commun. 2008) used asymptotic methods from statistical physics to analyze non-linear vector precoding for MIMO broadcast ...
Rodrigo de Miguel, Ralf R. Müller
FSE
2007
Springer
104views Cryptology» more  FSE 2007»
15 years 10 months ago
How to Enrich the Message Space of a Cipher
Abstract. Given (deterministic) ciphers E and E that can encipher messages of l and n bits, respectively, we construct a cipher E∗ = XLS[E, E] that can encipher messages of l + s...
Thomas Ristenpart, Phillip Rogaway