Sciweavers

160 search results - page 28 / 32
» The Analysis and Optimization of Collective Communications o...
Sort
View
ICALP
2005
Springer
14 years 1 months ago
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
Roberto Tamassia, Nikos Triandopoulos
SPAA
2003
ACM
14 years 29 days ago
Information gathering in adversarial systems: lines and cycles
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
Kishore Kothapalli, Christian Scheideler
EDBT
2006
ACM
191views Database» more  EDBT 2006»
14 years 7 months ago
Parallelizing Skyline Queries for Scalable Distribution
Skyline queries help users make intelligent decisions over complex data, where different and often conflicting criteria are considered. Current skyline computation methods are rest...
Ping Wu, Caijie Zhang, Ying Feng, Ben Y. Zhao, Div...
IPPS
1997
IEEE
13 years 12 months ago
Enhancing Software DSM for Compiler-Parallelized Applications
Current parallelizing compilers for message-passing machines only support a limited class of data-parallel applications. One method for eliminating this restriction is to combine ...
Peter J. Keleher, Chau-Wen Tseng
IJPP
2010
137views more  IJPP 2010»
13 years 6 months ago
Parallel Option Price Valuations with the Explicit Finite Difference Method
Abstract. We show how computations such as those involved in American or European-style option price valuations with the explicit finite difference method can be performed in par...
Alexandros V. Gerbessiotis