Sciweavers

1404 search results - page 203 / 281
» On General Laws of Complex Networks
Sort
View
FCCM
2006
IEEE
201views VLSI» more  FCCM 2006»
15 years 8 months ago
Hardware/Software Approach to Molecular Dynamics on Reconfigurable Computers
With advances in reconfigurable hardware, especially field-programmable gate arrays (FPGAs), it has become possible to use reconfigurable hardware to accelerate complex applicatio...
Ronald Scrofano, Maya Gokhale, Frans Trouw, Viktor...
UAI
2008
15 years 6 months ago
Strategy Selection in Influence Diagrams using Imprecise Probabilities
This paper describes a new algorithm to solve the decision making problem in Influence Diagrams based on algorithms for credal networks. Decision nodes are associated to imprecise...
Cassio Polpo de Campos, Qiang Ji
GECCO
2008
Springer
156views Optimization» more  GECCO 2008»
15 years 5 months ago
Computing minimum cuts by randomized search heuristics
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
Frank Neumann, Joachim Reichel, Martin Skutella
PODC
2010
ACM
15 years 4 months ago
Brief announcement: swarming secrets
We present information-theoretically secure schemes for sharing and modifying secrets among a dynamic swarm of computing devices. The schemes support an unlimited number of change...
Shlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir ...
TCSV
2008
152views more  TCSV 2008»
15 years 4 months ago
Animation Key-Frame Extraction and Simplification Using Deformation Analysis
Three-dimensional animating meshes have been widely used in the computer graphics and video game industries. Reducing the animating mesh complexity is a common way of overcoming th...
Tong-Yee Lee, Chao-Hung Lin, Yu-Shuen Wang, Tai-Gu...