Sciweavers

1161 search results - page 62 / 233
» Approximation schemes for clustering problems
Sort
View
ICML
2008
IEEE
15 years 10 months ago
ManifoldBoost: stagewise function approximation for fully-, semi- and un-supervised learning
We introduce a boosting framework to solve a classification problem with added manifold and ambient regularization costs. It allows for a natural extension of boosting into both s...
Nicolas Loeff, David A. Forsyth, Deepak Ramachandr...
ICDE
2009
IEEE
171views Database» more  ICDE 2009»
15 years 11 months ago
A Framework for Clustering Massive-Domain Data Streams
In this paper, we will examine the problem of clustering massive domain data streams. Massive-domain data streams are those in which the number of possible domain values for each a...
Charu C. Aggarwal
ICDS
2009
IEEE
15 years 4 months ago
A Hybrid Approach for Clustering-Based Data Aggregation in Wireless Sensor Networks
—In a wireless sensor network application for tracking multiple mobile targets, large amounts of sensing data can be generated by a number of sensors. These data must be controll...
Woo Sung Jung, Keun Woo Lim, Young-Bae Ko, Sang-Jo...
SAC
2002
ACM
14 years 9 months ago
A multi-agent system architecture for coordination of just-in-time production and distribution
A multi-agent system architecture for coordination of just-in-time production and distribution is presented. The problem to solve is two-fold: first the right amount of resources ...
Paul Davidsson, Fredrik Wernstedt
JDA
2008
94views more  JDA 2008»
14 years 9 months ago
Approximability of partitioning graphs with supply and demand
Suppose that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive real number, called the supply or the demand. Each demand vertex can ...
Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Ni...