5595 search results - page 250 / 1119 » Approximation Algorithms for Clustering Problems |
182
click to vote
SODA
2000
ACM
15 years 7 months ago
2000
ACM
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
161
Voted
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
Linear Logic is based on the analogy between algebraic linearity (i.e. commutation with sums and scalar products) and the computer science linearity (i.e. calling inputs only once...
173
click to vote
CINQ
2004
Springer
15 years 10 months ago
2004
Springer
We introduce the problem of cluster-grouping and show that it integrates several important data mining tasks, i.e. subgroup discovery, mining correlated patterns and aspects from c...
210
Voted
APNOMS
2006
Springer
15 years 10 months ago
2006
Springer
Setting up an IDS architecture on ad-hoc network is hard because it is not easy to find suitable locations to setup IDS's. One way is to divide the network into a set of clust...
172
click to vote
CCCG
1998
15 years 7 months ago
1998
Given a set P of n points in Rd, a fundamental problem in computational geometry is concerned with finding the smallest shape of some type that encloses all the points of P. Well-...