Sciweavers

9842 search results - page 350 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
SACMAT
2005
ACM
15 years 9 months ago
Purpose based access control of complex data for privacy protection
As privacy becomes a major concern for both consumers and enterprises, many research efforts have been devoted to the development of privacy protecting technology. We recently pr...
Ji-Won Byun, Elisa Bertino, Ninghui Li
SIGIR
2005
ACM
15 years 9 months ago
Optimization strategies for complex queries
Previous research into the efficiency of text retrieval systems has dealt primarily with methods that consider inverted lists in sequence; these methods are known as term-at-a-tim...
Trevor Strohman, Howard R. Turtle, W. Bruce Croft
151
Voted
INFOCOM
2003
IEEE
15 years 9 months ago
Network Management Information For Light-Path Assessment: Trade-off between Performance and Complexity
We investigate network management information for light-path assessment to dynamically set up end-to-end lightpaths across administrative domains. Our focus is on invetigating what...
Guanglei Liu, Chuanyi Ji, Vincent W. S. Chan
149
Voted
SIGDOC
2000
ACM
15 years 8 months ago
Making complex document structures accessible through templates
We address two problems of technical authors in structured environments: (1) Structure definitions of the SGML school are limiting: they require one primary hierarchy and do not c...
Felix H. Gatzemeier, Oliver Meyer
CRYPTO
2000
Springer
141views Cryptology» more  CRYPTO 2000»
15 years 8 months ago
Improved Non-committing Encryption Schemes Based on a General Complexity Assumption
Abstract. Non-committing encryption enables the construction of multiparty computation protocols secure against an adaptive adversary in the computational setting where private cha...
Ivan Damgård, Jesper Buus Nielsen