Sciweavers

1110 search results - page 182 / 222
» New Approximation Results for Resource Replication Problems
Sort
View
STOC
1994
ACM
128views Algorithms» more  STOC 1994»
15 years 2 months ago
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
Avrim Blum, Merrick L. Furst, Jeffrey C. Jackson, ...
TPDS
2002
141views more  TPDS 2002»
14 years 10 months ago
Integration of Pricing with Call Admission Control to Meet QoS Requirements in Cellular Networks
Call Admission Control (CAC) plays a significant role in providing the desired Quality of Service (QoS) in cellular networks. Traditional CAC schemes that mainly focus on the trade...
Jiongkuan Hou, Jie Yang, Symeon Papavassiliou
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
15 years 11 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
COMPGEOM
2009
ACM
15 years 5 months ago
Integral estimation from point cloud in d-dimensional space: a geometric view
Integration over a domain, such as a Euclidean space or a Riemannian manifold, is a fundamental problem across scientific fields. Many times, the underlying domain is only acces...
Chuanjiang Luo, Jian Sun, Yusu Wang
FOCS
2008
IEEE
15 years 5 months ago
What Can We Learn Privately?
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi ...