Sciweavers

1105 search results - page 123 / 221
» Approximate Spectral Clustering.
Sort
View
110
Voted
MLDM
1999
Springer
15 years 5 months ago
Non-hierarchical Clustering with Rival Penalized Competitive Learning for Information Retrieval
In large content-based image database applications, e cient information retrieval depends heavily on good indexing structures of the extracted features. While indexing techniques f...
Irwin King, Tak-Kan Lau
ADHOC
2005
122views more  ADHOC 2005»
15 years 22 days ago
Maintaining weakly-connected dominating sets for clustering ad hoc networks
An ad hoc network is a multihop wireless communication network supporting mobile users. Network performance degradation is a major problem as the network becomes larger. Clusterin...
Yuanzhu Peter Chen, Arthur L. Liestman
STOC
2007
ACM
146views Algorithms» more  STOC 2007»
16 years 1 months ago
Playing games with approximation algorithms
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
Sham M. Kakade, Adam Tauman Kalai, Katrina Ligett
INFORMATICALT
2010
103views more  INFORMATICALT 2010»
14 years 7 months ago
Multistage K-Means Clustering for Scenario Tree Construction
Abstract. In stochastic programming and decision analysis, an important issue consists in the approximate representation of the multidimensional stochastic underlying process in th...
Kristina Sutiene, Dalius Makackas, Henrikas Pranev...
113
Voted
CORR
2011
Springer
191views Education» more  CORR 2011»
14 years 7 months ago
On Approximating Four Covering and Packing Problems
In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of th...
Mary V. Ashley, Tanya Y. Berger-Wolf, Piotr Berman...