Sciweavers

2698 search results - page 135 / 540
» Approximation Algorithms for the Weighted Independent Set Pr...
Sort
View
FOCS
2006
IEEE
16 years 14 days ago
Inclusion--Exclusion Algorithms for Counting Set Partitions
Given an n-element set U and a family of subsets S ⊆ 2U we show how to count the number of k-partitions S1 ∪ · · · ∪ Sk = U into subsets Si ∈ S in time 2nnO(1). The only...
Andreas Björklund, Thore Husfeldt
AAAI
2007
15 years 8 months ago
Isometric Projection
Recently the problem of dimensionality reduction has received a lot of interests in many fields of information processing. We consider the case where data is sampled from a low d...
Deng Cai, Xiaofei He, Jiawei Han
ICML
2010
IEEE
15 years 7 months ago
Interactive Submodular Set Cover
We introduce a natural generalization of submodular set cover and exact active learning with a finite hypothesis class (query learning). We call this new problem interactive submo...
Andrew Guillory, Jeff Bilmes
ICC
2008
IEEE
112views Communications» more  ICC 2008»
16 years 26 days ago
Weighted Fair Uplink/Downlink Access Provisioning in IEEE 802.11e WLANs
— We present the unfairness problem between the uplink and the downlink flows in the IEEE 802.11e infrastructure Basic Service Set (BSS) when the default settings of the Enhance...
Feyza Keceli, Inanc Inan, Ender Ayanoglu
ICDE
2007
IEEE
126views Database» more  ICDE 2007»
16 years 7 months ago
Efficient Approximation Algorithms for Repairing Inconsistent Databases
We consider the problem of repairing a database that is inconsistent wrt a set of integrity constraints by updating numerical values. In particular, we concentrate on denial integ...
Andrei Lopatenko, Loreto Bravo