Sciweavers

1161 search results - page 113 / 233
» Approximation schemes for clustering problems
Sort
View
CDC
2008
IEEE
15 years 10 months ago
A monotonic algorithm for the optimal control of the Fokker-Planck equation
— Motivated by some crowd motion models in the presence of noise, we consider an optimal control problem governed by the Fokker-Planck equation. We sketch optimality conditions b...
Guillaume Carlier, Julien Salomon
ICDE
2009
IEEE
156views Database» more  ICDE 2009»
16 years 5 months ago
Online Anomaly Prediction for Robust Cluster Systems
In this paper, we present a stream-based mining algorithm for online anomaly prediction. Many real-world applications such as data stream analysis requires continuous cluster opera...
Xiaohui Gu, Haixun Wang
123
Voted
VLSISP
2002
124views more  VLSISP 2002»
15 years 3 months ago
Agglomerative Learning Algorithms for General Fuzzy Min-Max Neural Network
In this paper two agglomerative learning algorithms based on new similarity measures defined for hyperbox fuzzy sets are proposed. They are presented in a context of clustering and...
Bogdan Gabrys
ECCC
2006
109views more  ECCC 2006»
15 years 3 months ago
How to rank with few errors: A PTAS for Weighted Feedback Arc Set on Tournaments
Suppose you ran a chess tournament, everybody played everybody, and you wanted to use the results to rank everybody. Unless you were really lucky, the results would not be acyclic...
Claire Kenyon-Mathieu, Warren Schudy
128
Voted
COCOON
2005
Springer
15 years 9 months ago
Interval Subset Sum and Uniform-Price Auction Clearing
Abstract. We study the interval subset sum problem (ISSP), a generalization of the classic subset-sum problem, where given a set of intervals, the goal is to choose a set of intege...
Anshul Kothari, Subhash Suri, Yunhong Zhou