902 search results - page 21 / 181 » R* Search |
SWAP
2007
13 years 8 months ago
2007
This paper presents a method for encoding OWL-S atomic processes by means of SWRL rules and composing them using a backward search planning algorithm. A description of the prelimin...
ACSAC
2006
IEEE
14 years 1 months ago
2006
IEEE
This paper investigates the general problem of performing key-value search at untrusted servers without loss of user privacy. Specifically, given key-value pairs from multiple ow...
CPM
2001
Springer
13 years 12 months ago
2001
Springer
We present a solution to the problem of regular expression searching on compressed text. The format we choose is the Ziv-Lempel family, speci cally the LZ78 and LZW variants. Give...
ICDAR
2003
IEEE
14 years 20 days ago
2003
IEEE
Classifier subset selection (CSS) from a large ensemble is an effective way to design multiple classifier systems (MCSs). Given a validation dataset and a selection criterion, the...
FOGA
2007
13 years 8 months ago
2007
Barrier trees are a convenient way of representing the structure of complex combinatorial landscapes over graphs. Here we generalize the concept of barrier trees to landscapes de...