Sciweavers

2520 search results - page 274 / 504
» The complexity of approximating entropy
Sort
View
SIGMOD
2006
ACM
194views Database» more  SIGMOD 2006»
16 years 6 months ago
Graph-based synopses for relational selectivity estimation
This paper introduces the Tuple Graph (TuG) synopses, a new class of data summaries that enable accurate selectivity estimates for complex relational queries. The proposed summari...
Joshua Spiegel, Neoklis Polyzotis
ISSAC
2009
Springer
144views Mathematics» more  ISSAC 2009»
16 years 1 months ago
H-LLL: using householder inside LLL
We describe a new LLL-type algorithm, H-LLL, that relies on Householder transformations to approximate the underlying Gram-Schmidt orthogonalizations. The latter computations are ...
Ivan Morel, Damien Stehlé, Gilles Villard
CEC
2008
IEEE
16 years 1 months ago
Auto-tuning fuzzy granulation for evolutionary optimization
—Much of the computational complexity in employing evolutionary algorithms as optimization tool is due to the fitness function evaluation that may either not exist or be computat...
Mohsen Davarynejad, Mohammad R. Akbarzadeh-Totonch...
SECURWARE
2008
IEEE
16 years 1 months ago
Polynomial Heuristic Algorithms for Inconsistency Characterization in Firewall Rule Sets
Firewalls provide the first line of defence of nearly all networked institutions today. However, Firewall ACLs could have inconsistencies, allowing traffic that should be denied o...
Sergio Pozo Hidalgo, Rafael Ceballos, Rafael M. Ga...
HAPTICS
2007
IEEE
16 years 29 days ago
Accelerated Proximity Queries for Haptic Rendering of Deformable Models
We present a fast proximity query algorithm for haptic display of complex deformable models using a layered representation. Assuming that each solid model can be represented as a ...
Nico Galoppo, Miguel A. Otaduy, Paul Mecklenburg, ...