Sciweavers

10988 search results - page 2097 / 2198
» Algorithmic Folding Complexity
Sort
View
119
Voted
AIRS
2009
Springer
15 years 9 months ago
A Latent Dirichlet Framework for Relevance Modeling
Relevance-based language models operate by estimating the probabilities of observing words in documents relevant (or pseudo relevant) to a topic. However, these models assume that ...
Viet Ha-Thuc, Padmini Srinivasan
128
Voted
WINE
2009
Springer
178views Economy» more  WINE 2009»
15 years 9 months ago
Computing Optimal Contracts in Series-Parallel Heterogeneous Combinatorial Agencies
We study an economic setting in which a principal motivates a team of strategic agents to exert costly effort toward the success of a joint project. The action taken by each agent...
Yuval Emek, Michal Feldman
ATAL
2009
Springer
15 years 9 months ago
Reasoning intra-dependency in commitments for robust scheduling
Commitment-modeled protocols enable flexible and robust interactions among agents. However, existing work has focused on features and capabilities of protocols without considerin...
Mingzhong Wang, Kotagiri Ramamohanarao, Jinjun Che...
135
Voted
CCA
2009
Springer
15 years 9 months ago
Separations of Non-monotonic Randomness Notions
In the theory of algorithmic randomness, several notions of random sequence are defined via a game-theoretic approach, and the notions that received most attention are perhaps Mar...
Laurent Bienvenu, Rupert Hölzl, Thorsten Kr&a...
CIKM
2009
Springer
15 years 9 months ago
Mining linguistic cues for query expansion: applications to drug interaction search
Given a drug under development, what are other drugs or biochemical compounds that it might interact with? Early answers to this question, by mining the literature, are valuable f...
Sheng Guo, Naren Ramakrishnan
« Prev « First page 2097 / 2198 Last » Next »