Sciweavers

1389 search results - page 64 / 278
» Improved Approximation Algorithms for Label Cover Problems
Sort
View
119
Voted
ICTCS
2005
Springer
15 years 8 months ago
Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error
Abstract. We consider the problem of maintaining polynomial and exponential decay aggregates of a data stream, where the weight of values seen from the stream diminishes as time el...
Tsvi Kopelowitz, Ely Porat
INFOCOM
2009
IEEE
15 years 9 months ago
Approximation Algorithms for Data Broadcast in Wireless Networks
—Broadcasting is a fundamental operation in wireless networks and plays an important role in the communication protocol design. In multihop wireless networks, however, interferen...
Rajiv Gandhi, Yoo-Ah Kim, Seungjoon Lee, Jiho Ryu,...
AAAI
2011
14 years 2 months ago
End-User Feature Labeling via Locally Weighted Logistic Regression
Applications that adapt to a particular end user often make inaccurate predictions during the early stages when training data is limited. Although an end user can improve the lear...
Weng-Keen Wong, Ian Oberst, Shubhomoy Das, Travis ...
KDD
2008
ACM
140views Data Mining» more  KDD 2008»
16 years 3 months ago
Semi-supervised approach to rapid and reliable labeling of large data sets
Supervised classification methods have been shown to be very effective for a large number of applications. They require a training data set whose instances are labeled to indicate...
György J. Simon, Vipin Kumar, Zhi-Li Zhang
IWOCA
2009
Springer
149views Algorithms» more  IWOCA 2009»
15 years 9 months ago
Randomized Postoptimization of Covering Arrays
The construction of covering arrays with the fewest rows remains a challenging problem. Most computational and recursive constructions result in extensive repetition of coverage. W...
Peyman Nayeri, Charles J. Colbourn, Goran Konjevod