5214 search results - page 372 / 1043 » The Online Specialization Problem |
172
click to vote
ICA
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. In this paper, we consider the Independent Component Analysis problem when the hidden sources are non-negative (Non-negative ICA). This problem is formulated as a non-lin...
230
click to vote
IWPEC
2010
Springer
15 years 4 months ago
2010
Springer
We consider the computational complexity of a problem modeling bribery in the context of voting systems. In the scenario of Swap Bribery, each voter assigns a certain price for swa...
171
click to vote
CCCG
2009
15 years 4 months ago
2009
We consider a special class of art gallery problems inspired by wireless localization. Given a simple polygon P, place and orient guards each of which broadcasts a unique key with...
172
click to vote
EMNLP
2009
15 years 4 months ago
2009
The ambiguity of person names in the Web has become a new area of interest for NLP researchers. This challenging problem has been formulated as the task of clustering Web search r...
188
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We answer a problem posed in [GKM08] regarding a restricted model of small-space computation, tailored for solving the GEN problem. They define two variants of “incremental bra...