Sciweavers

3946 search results - page 175 / 790
» The computational complexity of choice sets
Sort
View
DEXAW
2005
IEEE
127views Database» more  DEXAW 2005»
16 years 6 days ago
A Key Establishment IP-Core for Ubiquitous Computing
A most critical and complex issue with regard to constrained devices in the ubiquitous and pervasive computing setting is secure key exchange. The restrictions motivate the invest...
Markus Volkmer, Sebastian Wallner
PSD
2004
Springer
132views Database» more  PSD 2004»
15 years 12 months ago
Computational Experiments with Minimum-Distance Controlled Perturbation Methods
Minimum-distance controlled perturbation is a recent family of methods for the protection of statistical tabular data. These methods are both efficient and versatile, since can dea...
Jordi Castro
INFOCOM
2003
IEEE
15 years 12 months ago
Computing the Types of the Relationships between Autonomous Systems
— We investigate the problem of computing the types of the relationships between Internet Autonomous Systems. We refer to the model introduced in [1], [2] that bases the discover...
Giuseppe Di Battista, Maurizio Patrignani, Maurizi...
CCCG
2007
15 years 8 months ago
Fast Computation of Smallest Enclosing Circle with Center on a Query Line Segment
Here we propose an efficient algorithm for computing the smallest enclosing circle whose center is constrained to lie on a query line segment. Our algorithm preprocesses a given s...
Arindam Karmakar, Sasanka Roy, Sandip Das
COORDINATION
2009
Springer
15 years 4 months ago
Automata for Context-Dependent Connectors
Abstract. Recent approaches to component-based software engineering employ coordinating connectors to compose components into software systems. For maximum flexibility and reuse, s...
Marcello M. Bonsangue, Dave Clarke, Alexandra Silv...