Sciweavers

1518 search results - page 86 / 304
» Exact and Approximate Bandwidth
Sort
View
ICDE
2008
IEEE
110views Database» more  ICDE 2008»
16 years 5 months ago
Standing Out in a Crowd: Selecting Attributes for Maximum Visibility
In recent years, there has been significant interest in development of ranking functions and efficient top-k retrieval algorithms to help users in ad-hoc search and retrieval in da...
Muhammed Miah, Gautam Das, Vagelis Hristidis, Heik...
VTC
2007
IEEE
146views Communications» more  VTC 2007»
15 years 10 months ago
Orthogonal STBC in General Nakagami-m Fading Channels: BER Analysis and Optimal Power Allocation
Abstract— We analyze the performance of multiple-input multiple-output (MIMO) systems employing orthogonal space-time block codes (STBC) in general Nakagami-m fading channels wit...
Andreas Müller, Joachim Speidel
APPROX
2004
Springer
120views Algorithms» more  APPROX 2004»
15 years 9 months ago
Simultaneous Source Location
We consider the problem of Simultaneous Source Location – selecting locations for sources in a capacitated graph such that a given set of demands can be satisfied. We give an ex...
Konstantin Andreev, Charles Garrod, Bruce M. Maggs...
ANTSW
2006
Springer
15 years 8 months ago
Kernelization as Heuristic Structure for the Vertex Cover Problem
Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...
Stephen Gilmour, Mark Dras
COMBINATORICS
2007
77views more  COMBINATORICS 2007»
15 years 4 months ago
Enumeration and Asymptotic Properties of Unlabeled Outerplanar Graphs
We determine the exact and asymptotic number of unlabeled outerplanar graphs. The exact number gn of unlabeled outerplanar graphs on n vertices can be computed in polynomial time,...
Manuel Bodirsky, Éric Fusy, Mihyun Kang, St...