Sciweavers

6142 search results - page 618 / 1229
» The Complexity of Partition Functions
Sort
View
EUROMICRO
2005
IEEE
16 years 24 days ago
Visual Assessment Techniques for Component-Based Framework Evolution
Many component models have been proposed to address the challenge of reducing software development time and costs. Such models often offer similar functionality. We study how deve...
Lucian Voinea, Alexandru Telea
ASIACRYPT
2005
Springer
16 years 22 days ago
Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation
We propose Gate Evaluation Secret Sharing (GESS) – a new kind of secret sharing, designed for use in secure function evaluation (SFE) with minimal interaction. The resulting simp...
Vladimir Kolesnikov
COCOON
2005
Springer
16 years 21 days ago
Randomized Quicksort and the Entropy of the Random Source
Abstract. The worst-case complexity of an implementation of Quicksort depends on the random number generator that is used to select the pivot elements. In this paper we estimate th...
Beatrice List, Markus Maucher, Uwe Schöning, ...
ISSAC
2005
Springer
101views Mathematics» more  ISSAC 2005»
16 years 20 days ago
Adherence is better than adjacency: computing the Riemann index using CAD
Given an elementary function with algebraic branch cuts, we show how to decide which sheet of the associated Riemann surface we are on at any given point. We do this by establishi...
James C. Beaumont, Russell J. Bradford, James H. D...
ADC
2004
Springer
90views Database» more  ADC 2004»
16 years 17 days ago
Representing and Reasoning on XForms Document
Forms are the most common way to interface users and Web-based applications. Traditional forms cannot provide the functionality needed to fulfil the requirements of complex appli...
Peng Yew Cheow, Guido Governatori