Sciweavers

1604 search results - page 282 / 321
» Approximation algorithms for developable surfaces
Sort
View
LATIN
2010
Springer
14 years 1 months ago
Euclidean Prize-Collecting Steiner Forest
In this paper, we consider Steiner forest and its generalizations, prize-collecting Steiner forest and k-Steiner forest, when the vertices of the input graph are points in the Euc...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi
IWANN
2009
Springer
14 years 1 months ago
A Soft Computing System to Perform Face Milling Operations
In this paper we present a soft computing system developed to optimize the face milling operation under High Speed conditions in the manufacture of steel components like molds with...
Raquel Redondo, Pedro Santos, Andrés Bustil...
CAV
2001
Springer
83views Hardware» more  CAV 2001»
14 years 1 months ago
Iterating Transducers
Regular languages have proved useful for the symbolic state exploration of infinite state systems. They can be used to represent infinite sets of system configurations; the tran...
Dennis Dams, Yassine Lakhnech, Martin Steffen
ISW
2001
Springer
14 years 1 months ago
Experimental Testing of the Gigabit IPSec-Compliant Implementations of Rijndael and Triple DES Using SLAAC-1V FPGA Accelerator B
In this paper, we present the results of the first phase of a project aimed at implementing a full suite of IPSec cryptographic transformations in reconfigurable hardware. Full imp...
Pawel Chodowiec, Kris Gaj, Peter Bellows, Brian Sc...
SIGGRAPH
2000
ACM
14 years 1 months ago
Dynamically reparameterized light fields
This research further develops the light field and lumigraph imagebased rendering methods and extends their utility. We present alternate parameterizations that permit 1) interac...
Aaron Isaksen, Leonard McMillan, Steven J. Gortler