Sciweavers

339 search results - page 16 / 68
» Is the Euclidean algorithm optimal among its peers
Sort
View
AAECC
2007
Springer
117views Algorithms» more  AAECC 2007»
13 years 8 months ago
A predictor-corrector-type technique for the approximate parameterization of intersection curves
Abstract We describe a method to approximate a segment of the intersection curve of two implicitly defined surfaces by a rational parametric curve. Starting from an initial soluti...
Bert Jüttler, Pavel Chalmovianský
EMSOFT
2007
Springer
14 years 2 months ago
A communication synthesis infrastructure for heterogeneous networked control systems and its application to building automation
In networked control systems the controller of a physicallydistributed plant is implemented as a collection of tightlyinteracting, concurrent processes running on a distributed ex...
Alessandro Pinto, Luca P. Carloni, Alberto L. Sang...
LATINCRYPT
2010
13 years 7 months ago
Accelerating Lattice Reduction with FPGAs
We describe an FPGA accelerator for the Kannan–Fincke– Pohst enumeration algorithm (KFP) solving the Shortest Lattice Vector Problem (SVP). This is the first FPGA implementati...
Jérémie Detrey, Guillaume Hanrot, Xa...
AAAI
2011
12 years 8 months ago
Optimal Envy-Free Cake Cutting
We consider the problem of fairly dividing a heterogeneous divisible good among agents with different preferences. Previous work has shown that envy-free allocations, i.e., where...
Yuga J. Cohler, John K. Lai, David C. Parkes, Arie...
ICNP
2006
IEEE
14 years 2 months ago
The Delicate Tradeoffs in BitTorrent-like File Sharing Protocol Design
— The BitTorrent (BT) file sharing protocol is popular due to its scalability property and the incentive mechanism to reduce free-riding. However, in designing such P2P file sh...
Bin Fan, Dah-Ming Chiu, John C. S. Lui