Sciweavers

216 search results - page 25 / 44
» A hybrid exact algorithm for complete set partitioning
Sort
View
STOC
2012
ACM
225views Algorithms» more  STOC 2012»
11 years 10 months ago
An algorithmic characterization of multi-dimensional mechanisms
We obtain a characterization of feasible, Bayesian, multi-item multi-bidder mechanisms with independent, additive bidders as distributions over hierarchical mechanisms. Combined w...
Yang Cai, Constantinos Daskalakis, S. Matthew Wein...
TWC
2008
117views more  TWC 2008»
13 years 7 months ago
On the design, selection algorithm and performance analysis of limited feedback transmit beamforming
Multiple-input multiple-output (MIMO) systems achieve significant diversity and array gains by using transmit beamforming. When complete channel state information (CSI) is not avai...
Alireza Ghaderipoor, Chintha Tellambura
COLT
1993
Springer
13 years 11 months ago
Parameterized Learning Complexity
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
Rodney G. Downey, Patricia A. Evans, Michael R. Fe...
ICCV
2007
IEEE
14 years 9 months ago
Learning Higher-order Transition Models in Medium-scale Camera Networks
We present a Bayesian framework for learning higherorder transition models in video surveillance networks. Such higher-order models describe object movement between cameras in the...
Ryan Farrell, David S. Doermann, Larry S. Davis
STACS
2007
Springer
14 years 1 months ago
New Approximation Algorithms for Minimum Cycle Bases of Graphs
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...