Sciweavers

2254 search results - page 70 / 451
» Computing the minimal covering set
Sort
View
DEXAW
2006
IEEE
139views Database» more  DEXAW 2006»
13 years 12 months ago
Consistent Query Answering By Minimal-Size Repairs
A database D may be inconsistent wrt a given set IC of integrity constraints. Consistent Query Answering is the problem of computing from D the answers to a query that are consist...
Andrei Lopatenko, Leopoldo E. Bertossi
CCCG
2001
13 years 11 months ago
Nearest neighbor search through function minimization
This paper describes a solution to the nearest neighbor problem. The proposed algorithm, which makes use of the triangle inequality property, is considered from a function minimiz...
Chang Shu, Michael A. Greenspan, Guy Godin
TCAD
2008
96views more  TCAD 2008»
13 years 10 months ago
An Implicit Approach to Minimizing Range-Equivalent Circuits
Abstract--Simplifying a combinational circuit while preserving its range has a variety of applications, such as combinational equivalence checking and random simulation. Previous a...
Yung-Chih Chen, Chun-Yao Wang
MM
2004
ACM
165views Multimedia» more  MM 2004»
14 years 3 months ago
Minimal structures for stories
Our research on Interactive Drama aims at conciliating interaction and story at the deepest level, the level of action. From a given story representation formalism, a set of eleme...
Nicolas Szilas, Jean-Hugues Réty
EVOW
2010
Springer
14 years 3 months ago
A Genetic Algorithm to Minimize Chromatic Entropy
We present an algorithmic approach to solving the problem of chromatic entropy, a combinatorial optimization problem related to graph coloring. This problem is a component in algor...
Greg Durrett, Muriel Médard, Una-May O'Reil...