Sciweavers

860 search results - page 54 / 172
» Lower Bounds on the Size of Test Data Sets
Sort
View
CDC
2009
IEEE
211views Control Systems» more  CDC 2009»
14 years 14 days ago
An event-triggered distributed primal-dual algorithm for Network Utility maximization
Abstract— Many problems associated with networked systems can be formulated as network utility maximization (NUM) problems. NUM problems maximize a global separable measure of ne...
Pu Wan, Michael D. Lemmon
DATAMINE
2006
230views more  DATAMINE 2006»
13 years 7 months ago
Mining top-K frequent itemsets from data streams
Frequent pattern mining on data streams is of interest recently. However, it is not easy for users to determine a proper frequency threshold. It is more reasonable to ask users to ...
Raymond Chi-Wing Wong, Ada Wai-Chee Fu
INFOCOM
2007
IEEE
14 years 2 months ago
Nearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks
Abstract— Data aggregation is a fundamental yet timeconsuming task in wireless sensor networks. We focus on the latency part of data aggregation. Previously, the data aggregation...
Scott C.-H. Huang, Peng-Jun Wan, Chinh T. Vu, Ying...
EWCBR
2006
Springer
13 years 11 months ago
Unsupervised Feature Selection for Text Data
Feature selection for unsupervised tasks is particularly challenging, especially when dealing with text data. The increase in online documents and email communication creates a nee...
Nirmalie Wiratunga, Robert Lothian, Stewart Massie
NIXDORF
1992
127views Hardware» more  NIXDORF 1992»
13 years 11 months ago
Three non Conventional Paradigms of Parallel Computation
Abstract. We consider three paradigms of computation where the bene ts of a parallel solution are greater than usual. Paradigm 1 works on a time-varying input data set, whose size ...
Fabrizio Luccio, Linda Pagli, Geppino Pucci