Sciweavers

3406 search results - page 515 / 682
» Computational models of classical conditioning
Sort
View
ACL
2012
13 years 7 months ago
Named Entity Disambiguation in Streaming Data
The named entity disambiguation task is to resolve the many-to-many correspondence between ambiguous names and the unique realworld entity. This task can be modeled as a classifi...
Alexandre Davis, Adriano Veloso, Altigran Soares d...
MOBICOM
2006
ACM
15 years 10 months ago
On the complexity of scheduling in wireless networks
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
Gaurav Sharma, Ravi R. Mazumdar, Ness B. Shroff
OR
2005
Springer
15 years 10 months ago
Optimal Fares for Public Transport
The fare planning problem for public transport is to design a system of fares that maximize the revenue. We introduce a nonlinear optimization model to approach this problem. It i...
Ralf Borndörfer, Marika Neumann, Marc E. Pfet...
TIFS
2008
157views more  TIFS 2008»
15 years 4 months ago
Subspace Approximation of Face Recognition Algorithms: An Empirical Study
We present a theory for constructing linear subspace approximations to face-recognition algorithms and empirically demonstrate that a surprisingly diverse set of face-recognition a...
Pranab Mohanty, Sudeep Sarkar, Rangachar Kasturi, ...
CSDA
2007
116views more  CSDA 2007»
15 years 4 months ago
Exploring the state sequence space for hidden Markov and semi-Markov chains
The knowledge of the state sequences that explain a given observed sequence for a known hidden Markovian model is the basis of various methods that may be divided into three categ...
Yann Guédon