1538 search results - page 140 / 308 » Spectral Techniques in Graph Algorithms |
101
Voted
DAC
2005
ACM
16 years 4 months ago
2005
ACM
Signal processing and multimedia applications are often implemented on resource constrained embedded systems. It is therefore important to find implementations that use as little ...
129
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
In Image Compression, the researchers' aim is to reduce the number of bits required to represent an image by removing the spatial and spectral redundancies. Recently discrete...
144
click to vote
MONET
2008
15 years 3 months ago
2008
This paper presents the performance comparison of efficiency. OFDM is well known as a spectrally efficient Cognitive Radio TDCS and OFDM based for MIMO system modulation mode which...
116
Voted
UIST
1994
ACM
15 years 7 months ago
1994
ACM
We propose a new evolutionary method of extracting user preferences from examples shown to an automatic graph layout system. Using stochastic methods such as simulated annealing a...
231
Voted
VLDB
2007
ACM
16 years 4 months ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...