Sciweavers

1297 search results - page 67 / 260
» fews 2007
Sort
View
COCOON
2007
Springer
15 years 6 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
COCOON
2007
Springer
15 years 6 months ago
On the Complexity of Finding an Unknown Cut Via Vertex Queries
We investigate the problem of finding an unknown cut through querying vertices of a graph G. Our complexity measure is the number of submitted queries. To avoid some worst cases, ...
Peyman Afshani, Ehsan Chiniforooshan, Reza Dorrigi...
CP
2007
Springer
15 years 6 months ago
Dealing with Incomplete Preferences in Soft Constraint Problems
We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, situations with several agents providing the data, or with possibl...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
DIS
2007
Springer
15 years 6 months ago
A Consequence Finding Approach for Full Clausal Abduction
Abductive inference has long been associated with the logic of scientific discovery and automated abduction is now being used in real scientific tasks. But few methods can exploi...
Oliver Ray, Katsumi Inoue
ECML
2007
Springer
15 years 6 months ago
Dual Strategy Active Learning
Abstract. Active Learning methods rely on static strategies for sampling unlabeled point(s). These strategies range from uncertainty sampling and density estimation to multi-factor...
Pinar Donmez, Jaime G. Carbonell, Paul N. Bennett