3220 search results - page 475 / 644 » Constrained Graph Processes |
165
click to vote
SMILE
2000
Springer
15 years 10 months ago
2000
Springer
Brute-forcedensematchingisusuallynotsatisfactorybecausethesame search range is used for the entire image, yielding potentially many false matches. In this paper, we propose a progr...
226
click to vote
FMSB
2008
15 years 8 months ago
2008
We introduce bounded asynchrony, a notion of concurrency tailored to the modeling of biological cell-cell interactions. Bounded asynchrony is the result of a scheduler that bounds ...
182
Voted
IJCAI
2003
15 years 7 months ago
2003
Refinement operators for theories avoid the problems related to the myopia of many relational learning algorithms based on the operators that refine single clauses. However, the n...
187
click to vote
APWEB
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. Information sharing on distributed collaboration usually occurs in broad, highly dynamic network-based environments, and formally accessing the resources in a secure mann...
158
click to vote
JETAI
2008
15 years 6 months ago
2008
Are minds really dynamical or are they really symbolic? Because minds are bundles of computations, and because computation is always a matter of interpretation of one system by an...