Sciweavers

825 search results - page 123 / 165
» Partitions of an Integer into Powers
Sort
View
SODA
2004
ACM
93views Algorithms» more  SODA 2004»
14 years 11 months ago
Bipartite roots of graphs
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
Lap Chi Lau
ESA
2010
Springer
170views Algorithms» more  ESA 2010»
14 years 11 months ago
Streaming Graph Computations with a Helpful Advisor
Motivated by the trend to outsource work to commercial cloud computing services, we consider a variation of the streaming paradigm where a streaming algorithm can be assisted by a...
Graham Cormode, Michael Mitzenmacher, Justin Thale...
GLOBECOM
2008
IEEE
14 years 11 months ago
Cooperative OFDM Channel Estimation with Frequency Offsets
Abstract— This paper discusses channel estimation in a cooperative orthogonal frequency-division multiplexing (OFDM) network in the presence of frequency offsets. Both the amplif...
Zhongshan Zhang, Wei Zhang, Chintha Tellambura
IJSNET
2008
138views more  IJSNET 2008»
14 years 9 months ago
Energy-efficient connected-coverage in wireless sensor networks
Abstract: This paper addresses the target coverage problem in wireless sensor networks. Communication and sensing consume energy, therefore efficient power management can extend ne...
Ionut Cardei, Mihaela Cardei
CORR
2010
Springer
131views Education» more  CORR 2010»
14 years 8 months ago
Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
: We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding ...
Henry Cohn, Nadia Heninger