Sciweavers

2631 search results - page 350 / 527
» Less is More
Sort
View
IJISEC
2007
87views more  IJISEC 2007»
15 years 4 months ago
Breaking four mix-related schemes based on Universal Re-encryption
Universal Re-encryption allows El-Gamal ciphertexts to be re-encrypted without knowledge of their corresponding public keys. This has made it an enticing building block for anonymo...
George Danezis
147
Voted
IJMMS
2007
142views more  IJMMS 2007»
15 years 4 months ago
Using OWL to model biological knowledge
Much has been written of the facilities for ontology building and reasoning offered for ontologies expressed in the Web Ontology Language (OWL). Less has been written about how th...
Robert Stevens, Mikel Egaña Aranguren, Katy...
AIEDU
2005
106views more  AIEDU 2005»
15 years 4 months ago
A Comparison of Model-Tracing and Constraint-Based Intelligent Tutoring Paradigms
Two approaches to building intelligent tutoring systems are the well-established model-tracing paradigm and the relatively newer constraint-based paradigm. Proponents of the constr...
Viswanathan Kodaganallur, Rob R. Weitz, David Rose...
AMAI
2005
Springer
15 years 4 months ago
Auction design with costly preference elicitation
We consider auction design in a setting with costly preference elicitation. Well designed auctions can help to avoid unnecessary elicitation while determining efficient allocations...
David C. Parkes
TCAD
2008
119views more  TCAD 2008»
15 years 3 months ago
FLUTE: Fast Lookup Table Based Rectilinear Steiner Minimal Tree Algorithm for VLSI Design
Abstract-- In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT) algorithm called FLUTE. FLUTE is based on pre-computed lookup table to make RS...
Chris C. N. Chu, Yiu-Chung Wong