Sciweavers

341 search results - page 25 / 69
» Quantum Computation and Lattice Problems
Sort
View
ICCS
2004
Springer
14 years 1 months ago
Iceberg Query Lattices for Datalog
In this paper we study two orthogonal extensions of the classical data mining problem of mining association rules, and show how they naturally interact. The first is the extension...
Gerd Stumme
GECCO
2007
Springer
179views Optimization» more  GECCO 2007»
14 years 1 months ago
The second harmonic generation case-study as a gateway for es to quantum control problems
The Second Harmonic Generation (SHG), a process that turns out to be a good test case in the physics lab, can also be considered as a fairly simple theoretical test function for g...
Ofer M. Shir, Thomas Bäck
STOC
1999
ACM
176views Algorithms» more  STOC 1999»
14 years 1 hour ago
On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
Johannes Blömer, Jean-Pierre Seifert
DLOG
2009
13 years 5 months ago
Reasoning With Weighted Ontologies
We study the problem of reasoning over weighted ontologies. We assume that every axiom is labeled with an element of a distributive lattice (called its weight) and try to compute i...
Rafael Peñaloza
ICFCA
2005
Springer
14 years 1 months ago
On Computing the Minimal Generator Family for Concept Lattices and Icebergs
Minimal generators (or mingen) constitute a remarkable part of the closure space landscape since they are the antipodes of the closures, i.e., minimal sets in the underlying equiva...
Kamal Nehmé, Petko Valtchev, Mohamed Rouane...