1809 search results - page 160 / 362 » Weakly Computable Real Numbers |
102
click to vote
CVPR
1996
IEEE
15 years 8 months ago
1996
IEEE
The Saliency Network proposed by Shashua and Ullman (1988) is a well-known approach to the problem of extracting salient curves from images while performing gap completion. This pa...
132
click to vote
BMCBI
2008
15 years 4 months ago
2008
Background: Computational discovery of motifs in biomolecular sequences is an established field, with applications both in the discovery of functional sites in proteins and regula...
160
click to vote
ACL
2009
15 years 2 months ago
2009
Dependency parsers show syntactic relations between words using a directed graph, but comparing dependency parsers is difficult because of differences in theoretical models. We de...
166
click to vote
SOICT
2010
14 years 11 months ago
2010
Protecting data by passwords in documents such as DOC, PDF or RAR, ZIP archives has been demonstrated to be weak under dictionary attacks. Time for recovering the passwords of suc...
137
click to vote
DEBS
2008
ACM
15 years 6 months ago
2008
ACM
Automatic service composition is an active research area in the field of service computing. This paper presents a distributed approach to automatically discover a composition of s...