Sciweavers

575 search results - page 51 / 115
» Computing Maximum Subsequence in Parallel
Sort
View
USM
2000
13 years 11 months ago
Trade-offs in a Secure Jini Service Architecture
Jini is an infrastructure built on top of the mobile code facilities of the Java programming language enabling clients and services to spontaneously engage in arbitrary usage scena...
Peer Hasselmeyer, Roger Kehr, Marco Voß
ISCAPDCS
2007
13 years 9 months ago
A Node-to-set cluster-fault-tolerant disjoint routing algorithm in pancake graphs
With rapid increase of parallel computation systems in their sizes, it is inevitable to develop algorithms that are applicable even if there exist faulty elements in the systems. ...
Tatsuro Watanabe, Keiichi Kaneko, Shietung Peng
EGC
2009
Springer
13 years 5 months ago
A Bayes Evaluation Criterion for Decision Trees
We present a new evaluation criterion for the induction of decision trees. We exploit a parameter-free Bayesian approach and propose an analytic formula for the evaluation of the p...
Nicolas Voisine, Marc Boullé, Carine Hue
IPPS
2008
IEEE
14 years 2 months ago
CoSL: A coordinated statistical learning approach to measuring the capacity of multi-tier websites
Website capacity determination is crucial to measurement-based access control, because it determines when to turn away excessive client requests to guarantee consistent service qu...
Jia Rao, Cheng-Zhong Xu
IPPS
2005
IEEE
14 years 1 months ago
Optimal Oblivious Path Selection on the Mesh
— In the oblivious path selection problem, each packet in the network independently chooses a path, which is an important property if the routing algorithm is to be independent o...
Costas Busch, Malik Magdon-Ismail, Jing Xi