4539 search results - page 186 / 908 » Approaches to Compute Workflow Complexity |
130
click to vote
ICIP
1997
IEEE
16 years 6 months ago
1997
IEEE
In this paper we examine the applicability of the previously proposed Greatest Common Divisor (GCD) method to blind image deconvolution. In this method, the desired image is appro...
119
click to vote
CIARP
2006
Springer
15 years 8 months ago
2006
Springer
Linear dimensionality reduction (LDR) is quite important in pattern recognition due to its efficiency and low computational complexity. In this paper, we extend the two-class Chern...
122
click to vote
WDAG
1995
Springer
15 years 8 months ago
1995
Springer
Abstract. A new algorithm is presented for detecting whether a particular computation of an asynchronous distributed system satisfies Poss Φ (read “possibly Φ”), meaning the...
132
click to vote
DALT
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. This paper proposes a formal framework for agent communication where agents can reason about their goals using strategic reasoning. This reasoning is argumentation-based ...
145
click to vote
AAAI
1994
15 years 5 months ago
1994
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...