1968 search results - page 321 / 394 » The Complexity of Valued Constraint Models |
147
click to vote
FGR
2011
IEEE
14 years 4 months ago
2011
IEEE
— In this work, we present novel warping algorithms for full 2D pixel-grid deformations for face recognition. Due to high variation in face appearance, face recognition is consid...
104
click to vote
CIKM
2009
Springer
15 years 8 months ago
2009
Springer
We are building an interactive, visual text analysis tool that aids users in analyzing a large collection of text. Unlike existing work in text analysis, which focuses either on d...
122
click to vote
FASE
2006
Springer
15 years 5 months ago
2006
Springer
Techniques for inferring a regular language, in the form of a finite automaton, from a sufficiently large sample of accepted and nonaccepted input words, have been employed to cons...
156
click to vote
EMNLP
2010
14 years 11 months ago
2010
In this paper, we develop multilingual supervised latent Dirichlet allocation (MLSLDA), a probabilistic generative model that allows insights gleaned from one language's data...
149
click to vote
FOSSACS
2001
Springer
15 years 6 months ago
2001
Springer
Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model, numerous undecidability results were obtained recently ...