Sciweavers

3894 search results - page 710 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
ICDM
2009
IEEE
117views Data Mining» more  ICDM 2009»
15 years 9 months ago
Discriminative Mixed-Membership Models
Although mixed-membership models have achieved great success in unsupervised learning, they have not been widely applied to classification problems. In this paper, we propose a f...
Hanhuai Shan, Arindam Banerjee, Nikunj C. Oza
INFOCOM
2009
IEEE
15 years 9 months ago
Diverse Routing in Networks with Probabilistic Failures
—We develop diverse routing schemes for dealing with multiple, possibly correlated, failures. While disjoint path protection can effectively deal with isolated single link failur...
Hyang-Won Lee, Eytan Modiano
ATAL
2009
Springer
15 years 9 months ago
Lossless clustering of histories in decentralized POMDPs
Decentralized partially observable Markov decision processes (Dec-POMDPs) constitute a generic and expressive framework for multiagent planning under uncertainty. However, plannin...
Frans A. Oliehoek, Shimon Whiteson, Matthijs T. J....
SIGECOM
2009
ACM
139views ECommerce» more  SIGECOM 2009»
15 years 9 months ago
Simple versus optimal mechanisms
The monopolist’s theory of optimal single-item auctions for agents with independent private values can be summarized by two statements. The first is from Myerson [8]: the optim...
Jason D. Hartline, Tim Roughgarden
SIGIR
2009
ACM
15 years 9 months ago
Automatic URL completion and prediction using fuzzy type-ahead search
Type-ahead search is a new information-access paradigm, in which systems can find answers to keyword queries “onthe-fly” as a user types in a query. It improves traditional ...
Jiannan Wang, Guoliang Li, Jianhua Feng