Sciweavers

291 search results - page 50 / 59
» Approximate centerpoints with proofs
Sort
View
CHES
2006
Springer
205views Cryptology» more  CHES 2006»
15 years 5 months ago
Automated Design of Cryptographic Devices Resistant to Multiple Side-Channel Attacks
Balanced dynamic dual-rail gates and asynchronous circuits have been shown, if implemented correctly, to have natural and efficient resistance to side-channel attacks. Despite thei...
Konrad J. Kulikowski, Alexander B. Smirnov, Alexan...
ESA
2006
Springer
126views Algorithms» more  ESA 2006»
15 years 5 months ago
Cooperative TSP
In this paper we introduce and study cooperative variants of the Traveling Salesperson Problem. In these problems a salesperson has to make deliveries to customers who are willing ...
Amitai Armon, Adi Avidor, Oded Schwartz
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
15 years 3 months ago
On allocations that maximize fairness
We consider a problem known as the restricted assignment version of the max-min allocation problem with indivisible goods. There are n items of various nonnegative values and m pl...
Uriel Feige
113
Voted
STRINGOLOGY
2004
15 years 3 months ago
Conditional Inequalities and the Shortest Common Superstring Problem
We investigate the shortest common superstring problem (SCSSP). As SCSSP is APX-complete it cannot be approximated within an arbitrarily small performance ratio. One heuristic tha...
Uli Laube, Maik Weinard
CSDA
2008
120views more  CSDA 2008»
15 years 1 months ago
Tree-structured smooth transition regression models
ABSTRACT. This paper introduces a tree-based model that combines aspects of CART (Classification and Regression Trees) and STR (Smooth Transition Regression). The model is called t...
Joel Corrêa da Rosa, Alvaro Veiga, Marcelo C...