Sciweavers

136 search results - page 15 / 28
» A Polynomial-Time Algorithm for Global Value Numbering
Sort
View
ICDT
2012
ACM
251views Database» more  ICDT 2012»
13 years 2 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
103
Voted
TSP
2008
115views more  TSP 2008»
14 years 11 months ago
Approximation Bounds for Semidefinite Relaxation of Max-Min-Fair Multicast Transmit Beamforming Problem
Consider a downlink multicast scenario where a base station equipped with multiple antennas wishes to simultaneously broadcast a number of signals to some given groups of users ove...
Tsung-Hui Chang, Zhi-Quan Luo, Chong-Yung Chi
PODC
2009
ACM
16 years 9 days ago
Oblivious interference scheduling
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
Alexander Fanghänel, Berthold Vöcking, H...
PAMI
2006
134views more  PAMI 2006»
14 years 11 months ago
A Genetic Algorithm Using Hyper-Quadtrees for Low-Dimensional K-means Clustering
The k-means algorithm is widely used for clustering because of its computational efficiency. Given n points in d-dimensional space and the number of desired clusters k, k-means see...
Michael Laszlo, Sumitra Mukherjee
IJCAI
1989
15 years 28 days ago
Training Feedforward Neural Networks Using Genetic Algorithms
Multilayered feedforward neural networks possess a number of properties which make them particularly suited to complex pattern classification problems. However, their application ...
David J. Montana, Lawrence Davis