Sciweavers

251 search results - page 33 / 51
» Approximation and Estimation Bounds for Artificial Neural Ne...
Sort
View
CEC
2008
IEEE
14 years 2 months ago
Correlation clustering based on genetic algorithm for documents clustering
—Correlation clustering problem is a NP hard problem and technologies for the solving of correlation clustering problem can be used to cluster given data set with relation matrix...
Zhenya Zhang, Hongmei Cheng, Wanli Chen, Shuguang ...
PVLDB
2008
116views more  PVLDB 2008»
13 years 7 months ago
Tighter estimation using bottom k sketches
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
Edith Cohen, Haim Kaplan
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
13 years 8 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
SIGMETRICS
2008
ACM
128views Hardware» more  SIGMETRICS 2008»
13 years 7 months ago
Confident estimation for multistage measurement sampling and aggregation
Measurement, collection, and interpretation of network usage data commonly involves multiple stage of sampling and aggregation. Examples include sampling packets, aggregating them...
Edith Cohen, Nick G. Duffield, Carsten Lund, Mikke...
FLAIRS
2006
13 years 9 months ago
A Cognitive Approach for Gateway Relocation in Wireless Sensor Networks
Wireless sensor networks are composed of a number of sensors probing their surroundings and disseminating the collected data to a gateway node for processing. Numerous military an...
Waleed A. Youssef, Mohamed F. Younis