Sciweavers

903 search results - page 148 / 181
» Non-well-founded trees in categories
Sort
View
CCS
2007
ACM
15 years 8 months ago
Privacy-preserving remote diagnostics
We present an efficient protocol for privacy-preserving evaluation of diagnostic programs, represented as binary decision trees or branching programs. The protocol applies a bran...
Justin Brickell, Donald E. Porter, Vitaly Shmatiko...
CIKM
2007
Springer
15 years 8 months ago
Effective keyword search for valuable lcas over xml documents
In this paper, we study the problem of effective keyword search over XML documents. We begin by introducing the notion of Valuable Lowest Common Ancestor (VLCA) to accurately and ...
Guoliang Li, Jianhua Feng, Jianyong Wang, Lizhu Zh...
87
Voted
DRM
2007
Springer
15 years 8 months ago
Data structures for limited oblivious execution of programs while preserving locality of reference
We introduce a data structure for program execution under a limited oblivious execution model. For fully oblivious execution along the lines of Goldreich and Ostrovsky [2], one tr...
Avinash V. Varadarajan, Ramarathnam Venkatesan, C....
GECCO
2007
Springer
129views Optimization» more  GECCO 2007»
15 years 8 months ago
Procreating V-detectors for nonself recognition: an application to anomaly detection in power systems
The artificial immune system approach for self-nonself discrimination and its application to anomaly detection problems in engineering is showing great promise. A seminal contribu...
Min Gui, Sanjoy Das, Anil Pahwa
GECCO
2007
Springer
180views Optimization» more  GECCO 2007»
15 years 8 months ago
Towards the coevolution of cellular automata controllers for chemical computing with the B-Z reaction
We propose that the behaviour of non-linear media can be controlled automatically through coevolutionary systems. By extension, forms of unconventional computing, i.e., massively ...
Christopher Stone, Rita Toth, Andrew Adamatzky, Be...