6251 search results - page 1010 / 1251 » Randomness, Computability, and Density |
154
click to vote
ACL
2009
15 years 2 months ago
2009
This paper presents ongoing research in clinical information extraction. This work introduces a new genre of text which are not well-written, noise prone, ungrammatical and with m...
161
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
162
click to vote
ICPR
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract--Rough face alignments lead to suboptimal performance of face identification systems. In this study, we present a novel approach for identifying genders from facial images...
167
click to vote
CVPR
2010
IEEE
16 years 1 months ago
2010
IEEE
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...
179
click to vote
CVPR
2011
IEEE
15 years 28 days ago
2011
IEEE
Automatic face photo-sketch recognition has important applications to law enforcement. Recent research has focused on transforming photos and sketches into the same modality for m...