Sciweavers

Share
ICISC
2008
146views Cryptology» more  ICISC 2008»
8 years 10 months ago
A New Technique for Multidimensional Linear Cryptanalysis with Applications on Reduced Round Serpent
Abstract. In this paper, we present a new technique for Matsui's algorithm 2 using multidimensional linear approximation. We show that the data complexity of the attack can be...
Joo Yeon Cho, Miia Hermelin, Kaisa Nyberg
CCIA
2008
Springer
8 years 11 months ago
On the Dimensions of Data Complexity through Synthetic Data Sets
Abstract. This paper deals with the characterization of data complexity and the relationship with the classification accuracy. We study three dimensions of data complexity: the len...
Núria Macià, Ester Bernadó-Ma...
AAAI
2007
8 years 11 months ago
DL-Lite in the Light of First-Order Logic
The use of ontologies in various application domains, such as Data Integration, the Semantic Web, or ontology-based data management, where ontologies provide the access to large a...
Alessandro Artale, Diego Calvanese, Roman Kontchak...
CTRSA
2006
Springer
129views Cryptology» more  CTRSA 2006»
9 years 26 days ago
Related-Key Impossible Differential Attacks on 8-Round AES-192
In this paper we examine the strength of AES against the related-key impossible differential attack, following the work of Jakimoski and Desmedt [12]. We use several additional obs...
Eli Biham, Orr Dunkelman, Nathan Keller
HAIS
2009
Springer
9 years 1 months ago
Beyond Homemade Artificial Data Sets
One of the most important challenges in supervised learning is how to evaluate the quality of the models evolved by different machine learning techniques. Up to now, we have relied...
Núria Macià, Albert Orriols-Puig, Es...
KR
2010
Springer
9 years 1 months ago
Worst-Case Optimal Reasoning for the Horn-DL Fragments of OWL 1 and 2
Horn fragments of Description Logics (DLs) have gained popularity because they provide a beneficial trade-off between expressive power and computational complexity and, more spec...
Magdalena Ortiz, Sebastian Rudolph, Mantas Simkus
SEMWEB
2004
Springer
9 years 2 months ago
Querying Faceted Databases
Faceted classification allows one to model applications with complex classification hierarchies using orthogonal dimensions. Recent work has examined the use of faceted classi...
Kenneth A. Ross, Angel Janevski
VL
2005
IEEE
107views Visual Languages» more  VL 2005»
9 years 2 months ago
Navigating Software Architectures with Constant Visual Complexity
Abstract— Visualizing software architecture faces the challenges of both data complexity and visual complexity. This paper presents an approach for visualizing software architect...
Wanchun Li, Peter Eades, Seok-Hee Hong
IV
2005
IEEE
131views Visualization» more  IV 2005»
9 years 2 months ago
A Framework for Visualising Large Graphs
Visualising large graphs faces the challenges of both data complexity and visual complexity. This paper presents a framework for visualising large graphs that reduces data complex...
Wanchun Li, Seok-Hee Hong, Peter Eades
LPAR
2007
Springer
9 years 3 months ago
Data Complexity in the EL Family of Description Logics
We study the data complexity of instance checking and conjunctive query answering in the EL family of description logics, with a particular emphasis on the boundary of tractability...
Adila Krisnadhi, Carsten Lutz
books