Results 11  20
of
10,965
Cooperative diversity in wireless networks: efficient protocols and outage behavior
 IEEE TRANS. INFORM. THEORY
, 2004
"... We develop and analyze lowcomplexity cooperative diversity protocols that combat fading induced by multipath propagation in wireless networks. The underlying techniques exploit space diversity available through cooperating terminals’ relaying signals for one another. We outline several strategies ..."
Abstract

Cited by 2009 (31 self)
 Add to MetaCart
We develop and analyze lowcomplexity cooperative diversity protocols that combat fading induced by multipath propagation in wireless networks. The underlying techniques exploit space diversity available through cooperating terminals’ relaying signals for one another. We outline several strategies
Graph partitioning via adaptive spectral techniques
 Comb. Probab. Comput
"... Abstract. In this paper we study the use of spectral techniques for graph partitioning. Let G = (V,E) be a graph whose vertex set has a “latent ” partition V1,..., Vk. Moreover, consider a “density matrix” E = (Evw)v,w∈V such that for v ∈ Vi and w ∈ Vj the entry Evw is the fraction of all possible V ..."
Abstract

Cited by 38 (0 self)
 Add to MetaCart
Abstract. In this paper we study the use of spectral techniques for graph partitioning. Let G = (V,E) be a graph whose vertex set has a “latent ” partition V1,..., Vk. Moreover, consider a “density matrix” E = (Evw)v,w∈V such that for v ∈ Vi and w ∈ Vj the entry Evw is the fraction of all possible
Graph Products, Fourier Analysis and Spectral Techniques
, 2003
"... We consider powers of regular graphs defined by the weak graph product and give a characterization of maximumsize independent sets for a wide family of base graphs which includes, among others, complete graphs, line graphs of regular graphs which contain a perfect matching and Kneser graphs. In man ..."
Abstract

Cited by 31 (10 self)
 Add to MetaCart
independent set of maximum size. Our approach is based on Fourier analysis on Abelian groups and on Spectral Techniques. To this end we develop some basic lemmas regarding the Fourier transform of functions on f0; : : : ; r \Gamma 1gn, generalizing some useful results from the f0; 1gn case.
Spectral Techniques for Graph Bisection in Genetic Algorithms
"... Various applications of spectral techniques for enhancing graph bisection in genetic algorithms are investigated. Several enhancements to a genetic algorithm for graph bisection are introduced based on spectral decompositions of adjacency matrices of graphs and subpopulation matrices. First, the spe ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Various applications of spectral techniques for enhancing graph bisection in genetic algorithms are investigated. Several enhancements to a genetic algorithm for graph bisection are introduced based on spectral decompositions of adjacency matrices of graphs and subpopulation matrices. First
Complementary Spectral Techniques for Authentication of Artistic Production
"... A crucial aspect in evaluation of artistic production was and it is still played by their authentication. This authentication became more important when it is decisive in attribution of unsigned drawing. Usually the correlation author – drawing influenced the impact of this picture by increasing or ..."
Abstract
 Add to MetaCart
in this way some common features with the signed drawings. This paper presents the atomic absorption spectroscopy as one of modern spectral techniques used for quantification of metallic ions present on drawing layer, knowing that especially for mineral pigments, metallic ions determine qualitative
SemiSupervised Regression using Spectral Techniques
, 2006
"... Graphbased approaches for semisupervised learning have received increasing amount of interest in recent years. Despite their good performance, many pure graph based algorithms do not have explicit functions and can not predict the label of unseen data. Graph regularization is a recently proposed f ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
novel method, called Spectral Regression (SR). By using spectral techniques, we first compute a set of responses for each sample which respects both the label information and geometrical structure. Once the responses are obtained, the ordinary ridge regression can be apply to find the regression
Implementation issues in spectrum sensing for cognitive radios
 in Proc. the 38th. Asilomar Conference on Signals, Systems, and Computers
, 2004
"... Abstract There are new system implementation challenges involved in the design of cognitive radios, which have both the ability to sense the spectral environment and the flexibility to adapt transmission parameters to maximize system capacity while coexisting with legacy wireless networks. The cri ..."
Abstract

Cited by 440 (7 self)
 Add to MetaCart
Abstract There are new system implementation challenges involved in the design of cognitive radios, which have both the ability to sense the spectral environment and the flexibility to adapt transmission parameters to maximize system capacity while coexisting with legacy wireless networks
A spectral technique for coloring random 3colorable graphs
 SIAM Journal on Computing
, 1994
"... Abstract. Let G3n,p,3 be a random 3colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes, and then choose every pair of vertices of distinct color classes, randomly and independently, to be edges with probability p. We des ..."
Abstract

Cited by 91 (2 self)
 Add to MetaCart
Abstract. Let G3n,p,3 be a random 3colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes, and then choose every pair of vertices of distinct color classes, randomly and independently, to be edges with probability p. We describe a polynomialtime algorithm that finds a proper 3coloring of G3n,p,3 with high probability, whenever p ≥ c/n, where c is a sufficiently large absolute constant. This settles a problem of Blum and Spencer, who asked if an algorithm can be designed that works almost surely for p ≥ polylog(n)/n [J. Algorithms, 19 (1995), pp. 204–234]. The algorithm can be extended to produce optimal kcolorings of random kcolorable graphs in a similar model as well as in various related models. Implementation results show that the algorithm performs very well in practice even for moderate values of c.
Reconstructing many partitions using spectral techniques
 Proceedings of the 15th International Symposium on Fundamentals of Computation Theory
, 2005
"... Abstract. A partitioning of a set of n items is a grouping of these items into k disjoint, equally sized classes. Any partition can be modeled as a graph. The items become the vertices of the graph and two vertices are connected by an edge if and only if the associated items belong to the same class ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
k of classes controls the difficulty of the task. We design a spectral partitioning algorithm that asymptotically almost surely reconstructs up to k = c √ n partitions, where c is a small constant, in time C k poly(n), where C is another constant. 1
Frugal mechanism design via spectral techniques
 IN: FOUNDATIONS OF COMPUTER SCIENCE, ANNUAL IEEE SYMPOSIUM ON
, 2010
"... ..."
Results 11  20
of
10,965