Sciweavers

138 search results - page 11 / 28
» Hardness of fully dense problems
Sort
View
AAIM
2007
Springer
151views Algorithms» more  AAIM 2007»
14 years 2 months ago
Acyclic Edge Colouring of Outerplanar Graphs
An acyclic edge colouring of a graph is a proper edge colouring having no 2-coloured cycle, that is, a colouring in which the union of any two colour classes forms a linear forest...
Rahul Muthu, N. Narayanan, C. R. Subramanian
SOFTVIS
2006
ACM
14 years 1 months ago
Semantic web data visualization with graph style sheets
Visual paradigms such as node-link diagrams are well suited to the representation of Semantic Web data encoded with the Resource Description Framework (RDF), whose data model can ...
Emmanuel Pietriga
COMPSAC
2005
IEEE
14 years 1 months ago
Autonomous Hot Patching for Web-Based Applications
Patching technologies are commonly applied to improve the dependability of software after release. This paper proposes an autonomous hot patching (AHP) framework to fully automate...
Hai Huang, Wei-Tek Tsai, Yinong Chen
EUROCRYPT
2011
Springer
12 years 11 months ago
Homomorphic Signatures for Polynomial Functions
We construct the first homomorphic signature scheme that is capable of evaluating multivariate polynomials on signed data. Given the public key and a signed data set, there is an...
Dan Boneh, David Mandell Freeman
IACR
2011
158views more  IACR 2011»
12 years 7 months ago
Can Homomorphic Encryption be Practical?
Abstract. The prospect of outsourcing an increasing amount of data storage and management to cloud services raises many new privacy concerns for individuals and businesses alike. T...
Kristin Lauter, Michael Naehrig, Vinod Vaikuntanat...