Sciweavers

254 search results - page 9 / 51
» Binary amiable Words
Sort
View
DMTCS
2010
163views Mathematics» more  DMTCS 2010»
15 years 3 months ago
On Uniform Recurrence of a Direct Product
A direct product of two words is a naturally defined word on the alphabet of pairs of symbols. We introduce the class URP of uniformly recurrent words such that a direct product o...
Pavel Vadimovich Salimov
AI
2009
Springer
16 years 16 days ago
Opinion Learning without Emotional Words
This paper shows that a detailed, although non-emotional, description of event or an action can be a reliable source for learning opinions. Empirical results show the practical uti...
Marina Sokolova, Guy Lapalme
ICML
2007
IEEE
16 years 6 months ago
Three new graphical models for statistical language modelling
The supremacy of n-gram models in statistical language modelling has recently been challenged by parametric models that use distributed representations to counteract the difficult...
Andriy Mnih, Geoffrey E. Hinton
PAMI
2007
101views more  PAMI 2007»
15 years 5 months ago
A Thousand Words in a Scene
— This paper presents a novel approach for visual scene modeling and classification, investigating the combined use of text modeling methods and local invariant features. Our wo...
Pedro Quelhas, Florent Monay, Jean-Marc Odobez, Da...
160
Voted
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
16 years 14 days ago
Hilbert's Thirteenth Problem and Circuit Complexity
We study the following question, communicated to us by Mikl´os Ajtai: Can all explicit (e.g., polynomial time computable) functions f : ({0, 1}w )3 → {0, 1}w be computed by word...
Kristoffer Arnsfelt Hansen, Oded Lachish, Peter Br...