Sciweavers

1219 search results - page 65 / 244
» Where to Look Next
Sort
View
DLOG
2011
13 years 1 months ago
The Complexity of Conjunctive Query Abduction in DL-Lite
In order to meet usability requirements, most logic-based applications provide explanation facilities for reasoning services. This holds also for DLs, where research focused on the...
Diego Calvanese, Magdalena Ortiz, Mantas Simkus, G...
CHES
2005
Springer
108views Cryptology» more  CHES 2005»
14 years 3 months ago
Further Hidden Markov Model Cryptanalysis
We extend the model of Karlof and Wagner for modelling side channel attacks via Input Driven Hidden Markov Models (IDHMM) to the case where not every state corresponds to a single ...
P. J. Green, Richard Noad, Nigel P. Smart
ALGORITHMICA
1998
184views more  ALGORITHMICA 1998»
13 years 9 months ago
Approximation Algorithms for Connected Dominating Sets
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
Sudipto Guha, Samir Khuller
MOR
2007
149views more  MOR 2007»
13 years 9 months ago
LP Rounding Approximation Algorithms for Stochastic Network Design
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
Anupam Gupta, R. Ravi, Amitabh Sinha
GAMESEC
2010
150views Game Theory» more  GAMESEC 2010»
13 years 7 months ago
Adversarial Control in a Delay Tolerant Network
We consider a multi-criteria control problem that arises in a delay tolerant network with two adversarial controllers: the source and the jammer. The source's objective is to ...
Eitan Altman, Tamer Basar, Veeraruna Kavitha