3641 search results - page 564 / 729 » On Computability of Pattern Recognition Problems |
131
Voted
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
Programs with irregular patterns of dynamic data structures and/or those with complicated control structures such as recursion are notoriously difficult to parallelize efficient...
108
click to vote
SAT
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We consider the problem of computing tractable approximations to CNF formulas, extending the approach of Selman and Kautz to compute the Horn-LUB to involve renaming of v...
124
click to vote
TLCA
2007
Springer
15 years 8 months ago
2007
Springer
Initial algebra semantics is a cornerstone of the theory of modern functional programming languages. For each inductive data type, it provides a fold combinator encapsulating struc...
138
click to vote
ISVC
2005
Springer
15 years 8 months ago
2005
Springer
This research features a novel approach that efficiently detects depth edges in real world scenes. Depth edges play a very important role in many computer vision problems because t...
103
click to vote
DIS
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Graph mining approaches are extremely popular and effective in molecular databases. The vast majority of these approaches first derive interesting, i.e. frequent, patte...