Sciweavers

369 search results - page 58 / 74
» Approximation Algorithms for the Bi-criteria Weighted max-cu...
Sort
View
WINE
2009
Springer
93views Economy» more  WINE 2009»
15 years 6 months ago
On Stackelberg Pricing with Computationally Bounded Consumers
In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset o...
Patrick Briest, Martin Hoefer, Luciano Gualà...
ML
2002
ACM
146views Machine Learning» more  ML 2002»
14 years 11 months ago
Kernel Matching Pursuit
Matching Pursuit algorithms learn a function that is a weighted sum of basis functions, by sequentially appending functions to an initially empty basis, to approximate a target fu...
Pascal Vincent, Yoshua Bengio
ICASSP
2008
IEEE
15 years 6 months ago
Multi-source DOA estimation in a reverberant room
In a reverberant scenario, phase transformed weighted algorithms are more robust than Maximum Likelihood (ML) because of the insufficiency of the data model to incorporate reverb...
Andreas M. Ali, Ralph E. Hudson, Kung Yao
TKDE
2008
121views more  TKDE 2008»
14 years 11 months ago
Schema Matching Using Interattribute Dependencies
Schema matching is one of the key challenges in information integration. It is a labor-intensive and time-consuming process. To alleviate the problem, many automated solutions have...
Jaewoo Kang, Jeffrey F. Naughton
ICALP
2005
Springer
15 years 5 months ago
New Approaches for Virtual Private Network Design
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo...