Sciweavers

664 search results - page 14 / 133
» Some results for a class of generalized polynomials
Sort
View
AAAI
2007
13 years 9 months ago
Learning Voting Trees
Binary voting trees provide a succinct representation for a large and prominent class of voting rules. In this paper, we investigate the PAC-learnability of this class of rules. W...
Ariel D. Procaccia, Aviv Zohar, Yoni Peleg, Jeffre...
AMC
2010
126views more  AMC 2010»
13 years 7 months ago
On condition numbers of polynomial eigenvalue problems
In this paper, we investigate condition numbers of eigenvalue problems of matrix polynomials with nonsingular leading coefficients, generalizing classical results of matrix pertur...
Nikolaos Papathanasiou, Panayiotis Psarrakos
POPL
2003
ACM
14 years 7 months ago
New results on the computability and complexity of points - to analysis
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
Venkatesan T. Chakaravarthy
PAMI
2008
189views more  PAMI 2008»
13 years 7 months ago
Detecting Objects of Variable Shape Structure With Hidden State Shape Models
This paper proposes a method for detecting object classes that exhibit variable shape structure in heavily cluttered images. The term "variable shape structure" is used t...
Jingbin Wang, Vassilis Athitsos, Stan Sclaroff, Ma...
COLT
2007
Springer
14 years 1 months ago
A Lower Bound for Agnostically Learning Disjunctions
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 there ...
Adam R. Klivans, Alexander A. Sherstov