Sciweavers

4047 search results - page 483 / 810
» Some Properties and Some Problems on Set Functors
Sort
View
CC
2010
Springer
120views System Software» more  CC 2010»
15 years 4 months ago
Lower Bounds for Agnostic Learning via Approximate Rank
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose that t...
Adam R. Klivans, Alexander A. Sherstov
ENTCS
2011
99views more  ENTCS 2011»
15 years 1 months ago
Symmetry and Composition in Probabilistic Theories
The past decade has seen a remarkable resurgence of the old programme of finding more or less a priori axioms for the mathematical framework of quantum mechanics. The new impetus...
Alexander Wilce
TSP
2011
96views more  TSP 2011»
15 years 1 months ago
A Signal Processing Approach to Fourier Analysis of Ranking Data: The Importance of Phase
—Ranking data is a type of data obtained in some elections, in customer surveys, as well as from web search results. Such data may be considered as a type of signal defined on t...
Ramakrishna Kakarala
ICCV
2011
IEEE
14 years 6 months ago
Perturb-and-MAP Random Fields: Using Discrete Optimization\\to Learn and Sample from Energy Models
We propose a novel way to induce a random field from an energy function on discrete labels. It amounts to locally injecting noise to the energy potentials, followed by finding t...
George Papandreou, Alan L. Yuille
INFOCOM
2005
IEEE
16 years 8 days ago
Distributed, secure load balancing with skew, heterogeneity and churn
— Numerous proposals exist for load balancing in peer-to-peer (p2p) networks. Some focus on namespace balancing, making the distance between nodes as uniform as possible. This te...
Jonathan Ledlie, Margo I. Seltzer