Sciweavers

217 search results - page 37 / 44
» Backdoors To Typical Case Complexity
Sort
View
107
Voted
WWW
2008
ACM
15 years 11 months ago
Efficiently querying rdf data in triple stores
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...
EUROCAST
2007
Springer
182views Hardware» more  EUROCAST 2007»
15 years 5 months ago
A k-NN Based Perception Scheme for Reinforcement Learning
Abstract a paradigm of modern Machine Learning (ML) which uses rewards and punishments to guide the learning process. One of the central ideas of RL is learning by “direct-online...
José Antonio Martin H., Javier de Lope Asia...
FC
2007
Springer
125views Cryptology» more  FC 2007»
15 years 5 months ago
Scalable Authenticated Tree Based Group Key Exchange for Ad-Hoc Groups
Task-specific groups are often formed in an ad-hoc manner within big structures, like companies. Take the following typical scenario: A high rank manager decides that a task force...
Yvo Desmedt, Tanja Lange, Mike Burmester
SP
2006
IEEE
214views Security Privacy» more  SP 2006»
15 years 5 months ago
Automatically Generating Malicious Disks using Symbolic Execution
Many current systems allow data produced by potentially malicious sources to be mounted as a file system. File system code must check this data for dangerous values or invariant ...
Junfeng Yang, Can Sar, Paul Twohey, Cristian Cadar...
INFOCOM
2003
IEEE
15 years 4 months ago
Adaptive Data Structures for IP Lookups
— The problem of efficient data structures for IP lookups has been well studied in literature. Techniques such as LC tries and Extensible Hashing are commonly used. In this pape...
Ioannis Ioannidis, Ananth Grama, Mikhail J. Atalla...