Sciweavers

4744 search results - page 111 / 949
» Connected Computing
Sort
View
PODS
2005
ACM
86views Database» more  PODS 2005»
15 years 8 months ago
An incremental algorithm for computing ranked full disjunctions
The full disjunction is a variation of the join operator that maximally combines tuples from connected relations, while preserving all information in the relations. The full disju...
Sara Cohen, Yehoshua Sagiv
CORR
2010
Springer
110views Education» more  CORR 2010»
15 years 3 months ago
(Unconditional) Secure Multiparty Computation with Man-in-the-middle Attacks
In secure multi-party computation n parties jointly evaluate an n-variate function f in the presence of an adversary which can corrupt up till t parties. All honest parties are req...
Shailesh Vaya
OPODIS
2008
15 years 4 months ago
Computing and Updating the Process Number in Trees
The process number is the minimum number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph ...
David Coudert, Florian Huc, Dorian Mazauric
CN
2007
80views more  CN 2007»
15 years 3 months ago
A queueing analysis for the denial of service (DoS) attacks in computer networks
In most network security analysis, researchers mainly focus on qualitative studies on security schemes and possible attacks, and there are few papers on quantitative analysis in t...
Yang Wang, Chuang Lin, Quan-Lin Li, Yuguang Fang
IPPS
1996
IEEE
15 years 7 months ago
Experience with Parallel Computing on the AN2 Network
Technology trends make it attractive to use workstations connected by a local area network as a multicomputing platform for parallel applications. Achieving acceptable application...
Daniel J. Scales, Michael Burrows, Chandramohan A....