Sciweavers

303 search results - page 11 / 61
» Incentive analysis of approximately efficient allocation alg...
Sort
View
NIPS
2001
13 years 9 months ago
Latent Dirichlet Allocation
We describe latent Dirichlet allocation (LDA), a generative probabilistic model for collections of discrete data such as text corpora. LDA is a three-level hierarchical Bayesian m...
David M. Blei, Andrew Y. Ng, Michael I. Jordan
ICDE
1998
IEEE
108views Database» more  ICDE 1998»
14 years 8 months ago
Efficient Discovery of Functional and Approximate Dependencies Using Partitions
Discovery of functionaldependencies from relations has been identified as an important database analysis technique. In this paper, we present a new approach for finding functional...
Ykä Huhtala, Juha Kärkkäinen, Pasi ...
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
13 years 9 months ago
On allocations that maximize fairness
We consider a problem known as the restricted assignment version of the max-min allocation problem with indivisible goods. There are n items of various nonnegative values and m pl...
Uriel Feige
COMCOM
2004
117views more  COMCOM 2004»
13 years 7 months ago
Dynamic bandwidth allocation in multi-class connection-oriented networks
Multi-class network is becoming a more attractive solution to provide Quality-of-Service guarantee, as more quality-demanding applications are emerging. This research considers ne...
Samer Taha, Mohsen Kavehrad
PODS
2007
ACM
203views Database» more  PODS 2007»
14 years 7 months ago
Decision trees for entity identification: approximation algorithms and hardness results
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...