Sciweavers

10608 search results - page 573 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
ICC
2009
IEEE
210views Communications» more  ICC 2009»
16 years 1 months ago
Weighted Sum-Rate Maximization Using Weighted MMSE for MIMO-BC Beamforming Design
—This paper studies linear transmit filter design for Weighted Sum-Rate (WSR) maximization in the Multiple Input Multiple Output Broadcast Channel (MIMO-BC). The problem of fin...
Søren Skovgaard Christensen, Rajiv Agarwal,...
ESA
2007
Springer
81views Algorithms» more  ESA 2007»
16 years 1 months ago
Farthest-Polygon Voronoi Diagrams
Given a family of k disjoint connected polygonal sites of total complexity n, we consider the farthest-site Voronoi diagram of these sites, where the distance to a site is the dis...
Otfried Cheong, Hazel Everett, Marc Glisse, Joachi...
ICMCS
2005
IEEE
105views Multimedia» more  ICMCS 2005»
16 years 21 days ago
Persistent audio modelling for background determination
This paper is concerned with modelling background audio online to detect foreground sounds in complex audio environments for surveillance and smart home applications. We examine a...
Simon Moncrieff, Svetha Venkatesh, Geoff A. W. Wes...
STACS
2005
Springer
16 years 18 days ago
Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
Carsten Witt
IWPEC
2004
Springer
16 years 14 days ago
Packing Edge Disjoint Triangles: A Parameterized View
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...
Luke Mathieson, Elena Prieto, Peter Shaw