1536 search results - page 38 / 308 » Approximately Dominating Representatives |
100
click to vote
SIAMCOMP
2008
14 years 11 months ago
2008
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...
108
click to vote
IJCNN
2000
IEEE
15 years 4 months ago
2000
IEEE
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...
107
click to vote
DM
2007
14 years 11 months ago
2007
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...
103
click to vote
EDBT
2006
ACM
15 years 12 months ago
2006
ACM
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-...
ATAL
2004
Springer
15 years 5 months ago
2004
Springer
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 ...