Sciweavers

1520 search results - page 171 / 304
» Class Hierarchy Specialization
Sort
View
LICS
2007
IEEE
15 years 11 months ago
Tractability and learnability arising from algebras with few subpowers
A k-edge operation ϕ on a finite set A is a k + 1-ary operation that satisfies the identities ϕ(x, x, y, . . . , y) ≈ ϕ(x, y, x, y, . . . , y) ≈ y and ϕ(y, y, y, x, y, ....
Pawel M. Idziak, Petar Markovic, Ralph McKenzie, M...
166
Voted
AWIC
2007
Springer
15 years 11 months ago
Improving Text Classification by Web Corpora
A major difficulty of supervised approaches for text classification is that they require a great number of training instances in order to construct an accurate classifier. This pap...
Rafael Guzmán-Cabrera, Manuel Montes-y-G&oa...
CAV
2007
Springer
104views Hardware» more  CAV 2007»
15 years 11 months ago
Revamping TVLA: Making Parametric Shape Analysis Competitive
Abstract. TVLA is a parametric framework for shape analysis that can be easily instantiated to create different kinds of analyzers for checking properties of programs that use link...
Igor Bogudlov, Tal Lev-Ami, Thomas W. Reps, Mooly ...
COCOON
2007
Springer
15 years 11 months ago
"Resistant" Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas
We derive quadratic lower bounds on the ∗-complexity of sum-of-products-of-sums (ΣΠΣ) formulas for classes of polynomials f that have too few partial derivatives for the techn...
Maurice J. Jansen, Kenneth W. Regan
ICALP
2007
Springer
15 years 11 months ago
Perfect Information Stochastic Priority Games
We introduce stochastic priority games — a new class of perfect information stochastic games. These games can take two different, but equivalent, forms. In stopping priority ga...
Hugo Gimbert, Wieslaw Zielonka