Sciweavers

5904 search results - page 1009 / 1181
» Requirements for a Composition Language
Sort
View
APPROX
2007
Springer
86views Algorithms» more  APPROX 2007»
14 years 1 months ago
Lower Bounds for Swapping Arthur and Merlin
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
Scott Diehl
CASES
2007
ACM
14 years 1 months ago
An integrated ARM and multi-core DSP simulator
In this paper we describe the design and implementation of a flexible, and extensible, just-in-time ARM simulator designed to run co-operatively with a multi-core DSP simulator on...
Sharad Singhai, MingYung Ko, Sanjay Jinturkar, May...
DEBS
2007
ACM
14 years 1 months ago
Concepts and models for typing events for event-based systems
Event-based systems are increasingly gaining widespread attention for applications that require integration with loosely coupled and distributed systems for time-critical business...
Szabolcs Rozsnyai, Josef Schiefer, Alexander Schat...
DUX
2007
14 years 1 months ago
AnyPhone: mobile applications for everyone
The mobile phone is one of the most commonly carried pieces of personal, readily accessible digital technologies. Beyond just voice calls, they function as digital cameras, PDAs, ...
Eric Paulos, August Joki, Parul Vora, Anthony Burk...
DEBS
2010
ACM
14 years 1 months ago
Reliable complex event detection for pervasive computing
Complex event processing for pervasive computing must deal with various sources of error. In this paper, we focus on improving complex event detector handling of several types of ...
Dan O'Keeffe, Jean Bacon
« Prev « First page 1009 / 1181 Last » Next »