Sciweavers

618 search results - page 77 / 124
» Short cycle connectivity
Sort
View
NDSS
2006
IEEE
15 years 5 months ago
Toward a Practical Data Privacy Scheme for a Distributed Implementation of the Smith-Waterman Genome Sequence Comparison Algorit
Volunteer distributed computations utilize spare processor cycles of personal computers that are connected to the Internet. The resulting platforms provide computational power pre...
Doug Szajda, Michael Pohl, Jason Owen, Barry G. La...
APCSAC
2005
IEEE
15 years 5 months ago
A Fault-Tolerant Routing Strategy for Fibonacci-Class Cubes
Fibonacci Cubes (FCs), together with the enhanced and extended forms, are a family of interconnection topologies formed by diluting links from binary hypercube. While they scale up...
Zhang Xinhua, Peter Loh
CLUSTER
2005
IEEE
15 years 5 months ago
Toward an Optimal Redundancy Strategy for Distributed Computations
Volunteer distributed computations utilize spare processor cycles of personal computers that are connected to the Internet. The related computation integrity concerns are commonly...
Doug Szajda, Barry Lawson, Jason Owen
ROBOCUP
2005
Springer
109views Robotics» more  ROBOCUP 2005»
15 years 5 months ago
Using the Max-Plus Algorithm for Multiagent Decision Making in Coordination Graphs
Abstract. Coordination graphs offer a tractable framework for cooperative multiagent decision making by decomposing the global payoff function into a sum of local terms. Each age...
Jelle R. Kok, Nikos A. Vlassis
WADS
2005
Springer
122views Algorithms» more  WADS 2005»
15 years 5 months ago
Hinged Dissection of Polypolyhedra
This paper presents a general family of 3D hinged dissections for polypolyhedra, i.e., connected 3D solids formed by joining several rigid copies of the same polyhedron along iden...
Erik D. Demaine, Martin L. Demaine, Jeffrey F. Lin...