Sciweavers

1536 search results - page 38 / 308
» Approximately Dominating Representatives
Sort
View
SIAMCOMP
2008
124views more  SIAMCOMP 2008»
13 years 7 months ago
A Faster, Better Approximation Algorithm for the Minimum Latency Problem
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
Aaron Archer, Asaf Levin, David P. Williamson
IJCNN
2000
IEEE
14 years 3 days ago
Fuzzy Clustering Algorithm Extracting Principal Components Independent of Subsidiary Variables
Fuzzy c-varieties (FCV) is one of the clustering algorithms in which the prototypes are multi-dimensional linear varieties. The linear varieties are represented by some local prin...
Chi-Hyon Oh, Hirokazu Komatsu, Katsuhiro Honda, Hi...
DM
2007
125views more  DM 2007»
13 years 7 months ago
Generalized switch-setting problems
Switch-setting games like Lights Out are typically modelled as a graph, where the vertices represent switches and lamps, and the edges capture the switching rules. We generalize t...
Torsten Muetze
EDBT
2006
ACM
182views Database» more  EDBT 2006»
14 years 7 months ago
On High Dimensional Skylines
In many decision-making applications, the skyline query is frequently used to find a set of dominating data points (called skyline points) in a multidimensional dataset. In a high-...
Chee Yong Chan, H. V. Jagadish, Kian-Lee Tan, Anth...
ATAL
2004
Springer
14 years 1 months ago
A Study of Limited-Precision, Incremental Elicitation in Auctions
We investigate the design of iterative, limited-precision mechanisms for single-good auctions with dominant strategy equilibria. Our aim is to design mechanisms that minimize the ...
Alexander Kress, Craig Boutilier