Sciweavers

664 search results - page 40 / 133
» Some results for a class of generalized polynomials
Sort
View
INFOCOM
2008
IEEE
15 years 4 months ago
Towards a Theory of Robust Localization Against Malicious Beacon Nodes
—Localization in the presence of malicious beacon nodes is an important problem in wireless networks. Although significant progress has been made on this problem, some fundament...
Sheng Zhong, Murtuza Jadliwala, Shambhu J. Upadhya...
FOCS
2008
IEEE
15 years 4 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 ...
ICML
2003
IEEE
15 years 10 months ago
Probabilistic Classifiers and the Concepts They Recognize
We investigate algebraic, logical, and geometric properties of concepts recognized by various classes of probabilistic classifiers. For this we introduce a natural hierarchy of pr...
Manfred Jaeger
MOBIHOC
2002
ACM
15 years 9 months ago
Algorithmic aspects of topology control problems for ad hoc networks
Topology control problems are concerned with the assignment of power values to the nodes of an ad hoc network so that the power assignment leads to a graph topology satisfying som...
Errol L. Lloyd, Rui Liu, Madhav V. Marathe, Ram Ra...
JMLR
2010
134views more  JMLR 2010»
14 years 4 months ago
Using Contextual Representations to Efficiently Learn Context-Free Languages
We present a polynomial update time algorithm for the inductive inference of a large class of context-free languages using the paradigm of positive data and a membership oracle. W...
Alexander Clark, Rémi Eyraud, Amaury Habrar...