Sciweavers

5180 search results - page 200 / 1036
» Concurrency, Time, and Constraints
Sort
View
158
Voted
IPPS
1999
IEEE
15 years 11 months ago
Hiding Communication Latency in Reconfigurable Message-Passing Environments
Communication overhead is one of the most important factors affecting the performance of message passing multicomputers. We present evidence (through the analysis of several paral...
Ahmad Afsahi, Nikitas J. Dimopoulos
IPPS
1998
IEEE
15 years 11 months ago
Hiding Communication Latency in Data Parallel Applications
Interprocessor communication times can be a significant fraction of the overall execution time required for data parallel applications. Large communication to computation ratios o...
Vivek Garg, David E. Schimmel
POPL
2000
ACM
15 years 10 months ago
Verifying Secrets and Relative Secrecy
Systems that authenticate a user based on a shared secret (such as a password or PIN) normally allow anyone to query whether the secret is a given value. For example, an ATM machi...
Dennis M. Volpano, Geoffrey Smith
SIAMDM
2000
159views more  SIAMDM 2000»
15 years 6 months ago
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...
Lisa Fleischer
SSD
2007
Springer
116views Database» more  SSD 2007»
16 years 21 days ago
Continuous Constraint Query Evaluation for Spatiotemporal Streams
In this paper we study the evaluation of continuous constraint queries (CCQs) for spatiotemporal streams. A CCQ triggers an alert whenever a configuration of constraints between s...
Marios Hadjieleftheriou, Nikos Mamoulis, Yufei Tao