Sciweavers

1869 search results - page 374 / 374
» Minimizing Distribution Cost of Distributed Neural Networks ...
Sort
View
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
14 years 5 months ago
Constraint-driven clustering
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
Rong Ge, Martin Ester, Wen Jin, Ian Davidson
SDM
2007
SIAM
131views Data Mining» more  SDM 2007»
13 years 6 months ago
Load Shedding in Classifying Multi-Source Streaming Data: A Bayes Risk Approach
In many applications, we monitor data obtained from multiple streaming sources for collective decision making. The task presents several challenges. First, data in sensor networks...
Yijian Bai, Haixun Wang, Carlo Zaniolo
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
13 years 5 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe
TWC
2008
141views more  TWC 2008»
13 years 4 months ago
Progressive Accumulative Routing: Fundamental Concepts and Protocol
This paper considers a multi-hop network in which relay nodes cooperate to minimize the total energy consumed in transmitting a (unicast) packet from a source to a destination. We...
Raymond Yim, Neelesh B. Mehta, Andreas F. Molisch,...