3641 search results - page 224 / 729 » On Computability of Pattern Recognition Problems |
198
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
Graphs capture the essential elements of many problems broadly defined as searching or categorizing. With the rapid increase of data volumes from sensors, many application discipl...
150
click to vote
AAAI
1994
15 years 8 months ago
1994
This paper describes an extension to the constraint satisfaction problem (CSP) approach called MUSE CSP (Multiply SEgmented Constraint Satisfaction Problem). This extension is esp...
208
click to vote
ICPR
2008
IEEE
16 years 8 months ago
2008
IEEE
Impression evidence in the form of shoe-prints are commonly found in crime scenes. A critical step in automatic shoe-print identification is extraction of the shoe-print pattern. ...
192
click to vote
EDO
2000
Springer
15 years 10 months ago
2000
Springer
Developing a distributed application is hard due to the complexity inherent to distributed communication. Moreover, distributed object communication technology is always changing,...
302
click to vote
TCS
2011
15 years 2 months ago
2011
We consider some Riordan arrays related to binary words avoiding a pattern p, which can be easily studied by means of an A-matrix rather than their A-sequence. Both concepts allow...