Sciweavers

1538 search results - page 135 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
JSAC
2006
133views more  JSAC 2006»
15 years 1 months ago
Code-aided joint channel and frequency offset estimation for DS-CDMA
This paper deals with joint data detection, synchronization and channel parameter estimation for Direct-Sequence Code Division Multiple Access (DS-CDMA) systems over frequency sel...
Mamoun Guenach, Frederik Simoens, Henk Wymeersch, ...
CDC
2009
IEEE
151views Control Systems» more  CDC 2009»
15 years 6 months ago
Shortest path optimization under limited information
— The problem of finding an optimal path in an uncertain graph arises in numerous applications, including network routing, path-planning for vehicles, and the control of finite...
Michael Rinehart, Munther A. Dahleh
ICASSP
2011
IEEE
14 years 5 months ago
Multi-graph regularization for efficient delivery of user generated content in online social networks
We present a methodology for enhancing the delivery of usergenerated content in online social networks. To this end, we first regularize the social graph via node capacity and li...
Jacob Chakareski
DCOSS
2008
Springer
15 years 3 months ago
Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
Andreas Wiese, Evangelos Kranakis
APPROX
2008
Springer
89views Algorithms» more  APPROX 2008»
15 years 3 months ago
Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
Hang Dinh, Alexander Russell