Sciweavers

1806 search results - page 72 / 362
» Some Functions Computable with a Fused-Mac
Sort
View
STOC
1996
ACM
100views Algorithms» more  STOC 1996»
15 years 10 months ago
The Linear-Array Conjecture in Communication Complexity is False
A linear array network consists of k + 1 processors P0; P1; : : : ; Pk with links only between Pi and Pi+1 0 i k. It is required to compute some boolean function f x; y in this n...
Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky
IANDC
2006
102views more  IANDC 2006»
15 years 5 months ago
Polynomial certificates for propositional classes
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
Marta Arias, Aaron Feigelson, Roni Khardon, Rocco ...
OOIS
2001
Springer
15 years 10 months ago
Analysis of Software Engineering Data Using Computational Intelligence Techniques
The accurate estimation of software development effort has major implications for the management of software development in the industry. Underestimates lead to time pressures tha...
Gabriel Jarillo, Giancarlo Succi, Witold Pedrycz, ...
COCO
2005
Springer
153views Algorithms» more  COCO 2005»
15 years 11 months ago
Average-Case Computations - Comparing AvgP, HP, and Nearly-P
We examine classes of distributional problems defined in terms of polynomial-time decision algorithms with bounded error probability. The class AvgP [5] has been characterized in...
Arfst Nickelsen, Birgit Schelm
ECCV
2004
Springer
16 years 7 months ago
A Biologically Motivated and Computationally Tractable Model of Low and Mid-Level Vision Tasks
This paper presents a biologically motivated model for low and mid-level vision tasks and its interpretation in computer vision terms. Initially we briefly present the biologically...
Iasonas Kokkinos, Rachid Deriche, Petros Maragos, ...