Sciweavers

2446 search results - page 427 / 490
» Choiceless Polynomial Time
Sort
View
AAAI
2007
13 years 10 months ago
Approximating OWL-DL Ontologies
Efficient query answering over ontologies is one of the most useful and important services to support Semantic Web applications. Approximation has been identified as a potential...
Jeff Z. Pan, Edward Thomas
AAAI
2008
13 years 10 months ago
Prime Implicate Normal Form for ALC Concepts
In this paper, we present a normal form for concept expressions in the description logic ALC which is based on a recently introduced notion of prime implicate for the modal logic ...
Meghyn Bienvenu
ATAL
2008
Springer
13 years 9 months ago
Synthesis of strategies from interaction traces
We describe how to take a set of interaction traces produced by different pairs of players in a two-player repeated game, and combine them into a composite strategy. We provide an...
Tsz-Chiu Au, Sarit Kraus, Dana S. Nau
CHES
2008
Springer
132views Cryptology» more  CHES 2008»
13 years 9 months ago
Light-Weight Instruction Set Extensions for Bit-Sliced Cryptography
Bit-slicing is a non-conventional implementation technique for cryptographic software where an n-bit processor is considered as a collection of n 1-bit execution units operating in...
Philipp Grabher, Johann Großschädl, Dan...
MICCAI
2009
Springer
13 years 9 months ago
Optimal Graph Search Segmentation Using Arc-weighted Graph for Simultaneous Surface Detection of Bladder and Prostate
We present a novel method for globally optimal surface segmentation of multiple mutually interacting objects, incorporating both edge and shape knowledge in a 3-D graph-theoretic a...
Qi Song, Xiaodong Wu, Yunlong Liu, Mark Smith, Joh...