Sciweavers

15073 search results - page 376 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
AAAI
2010
15 years 6 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
IANDC
2010
67views more  IANDC 2010»
15 years 3 months ago
Parameterized computational complexity of Dodgson and Young elections
We show that the two NP-complete problems of Dodgson Score and Young Score have differing computational complexities when the winner is close to being a Condorcet winner. On the ...
Nadja Betzler, Jiong Guo, Rolf Niedermeier
FOSSACS
2009
Springer
15 years 12 months ago
Coalgebraic Hybrid Logic
Abstract. We introduce a generic framework for hybrid logics, i.e. modal logics additionally featuring nominals and satisfaction operators, thus providing the necessary facilities ...
Rob Myers, Dirk Pattinson, Lutz Schröder
SIGIR
2008
ACM
15 years 5 months ago
Topic-bridged PLSA for cross-domain text classification
In many Web applications, such as blog classification and newsgroup classification, labeled data are in short supply. It often happens that obtaining labeled data in a new domain ...
Gui-Rong Xue, Wenyuan Dai, Qiang Yang, Yong Yu
ICAPR
2009
Springer
15 years 11 months ago
Hierarchical Local Maps for Robust Approximate Nearest Neighbor Computation
In this paper, we propose a novel method for fast nearest neighbors retrieval in non-Euclidean and non-metric spaces. We organize the data into a hierarchical fashion that preserv...
Pratyush Bhatt, Anoop M. Namboodiri