Sciweavers

329 search results - page 16 / 66
» How accurately can we model timing in a placement engine
Sort
View
AAAI
2010
13 years 9 months ago
Complexity of Computing Optimal Stackelberg Strategies in Security Resource Allocation Games
Recently, algorithms for computing game-theoretic solutions have been deployed in real-world security applications, such as the placement of checkpoints and canine units at Los An...
Dmytro Korzhyk, Vincent Conitzer, Ronald Parr
ICASSP
2011
IEEE
12 years 11 months ago
Extensions of recurrent neural network language model
We present several modifications of the original recurrent neural network language model (RNN LM). While this model has been shown to significantly outperform many competitive l...
Tomas Mikolov, Stefan Kombrink, Lukas Burget, Jan ...
ALGORITHMICA
2007
132views more  ALGORITHMICA 2007»
13 years 7 months ago
On the Feasibility of Time Estimation under Isolation Conditions in Wireless Sensor Networks
We study the problem of providing a sensor with an accurate estimate of the time, from a novel perspective which is complementary to the well-studied clock synchronization problem....
Daniela Tulone
WWW
2008
ACM
14 years 8 months ago
Analyzing search engine advertising: firm behavior and cross-selling in electronic markets
The phenomenon of sponsored search advertising is gaining ground as the largest source of revenues for search engines. Firms across different industries have are beginning to adop...
Anindya Ghose, Sha Yang
WWW
2009
ACM
14 years 8 months ago
A search-based method for forecasting ad impression in contextual advertising
Contextual advertising (also called content match) refers to the placement of small textual ads within the content of a generic web page. It has become a significant source of rev...
Xuerui Wang, Andrei Z. Broder, Marcus Fontoura, Va...