Sciweavers

2924 search results - page 333 / 585
» Lower Bounds in Distributed Computing
Sort
View
136
Voted
ACMSE
2004
ACM
15 years 10 months ago
Integrating publisher/subscriber services in component middleware for distributed real-time and embedded systems
Although component-based software development has widespread acceptance in the enterprise business and desktop application domains, developers of distributed, real-time and embedd...
George T. Edwards, Douglas C. Schmidt, Aniruddha S...
JNW
2007
100views more  JNW 2007»
15 years 4 months ago
Towards a Novel Metadata Information Service for Distributed Data Management
— The trend in Grid computing towards more data intensive applications, accessing more and more relational databases and requiring advanced integration of secondhand and publicly...
Alexander Wöhrer, Peter Brezany
FOCS
2009
IEEE
15 years 11 months ago
Instance-Optimal Geometric Algorithms
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
Peyman Afshani, Jérémy Barbay, Timot...
147
Voted
DCOSS
2009
Springer
15 years 11 months ago
Optimal Allocation of Time-Resources for Multihypothesis Activity-Level Detection
Abstract. The optimal allocation of samples for activity-level detection in a wireless body area network for health-monitoring applications is considered. A wireless body area netw...
Gautam Thatte, Viktor Rozgic, Ming Li, Sabyasachi ...
TCC
2009
Springer
146views Cryptology» more  TCC 2009»
16 years 5 months ago
An Optimally Fair Coin Toss
We address one of the foundational problems in cryptography: the bias of coin-flipping protocols. Coin-flipping protocols allow mutually distrustful parties to generate a common u...
Tal Moran, Moni Naor, Gil Segev