Sciweavers

849 search results - page 122 / 170
» On the Complexity of the Whitehead Minimization Problem
Sort
View
CORR
2011
Springer
210views Education» more  CORR 2011»
13 years 29 days ago
Transmission with Energy Harvesting Nodes in Fading Wireless Channels: Optimal Policies
Wireless systems comprised of rechargeable nodes have a significantly prolonged lifetime and are sustainable. A distinct characteristic of these systems is the fact that the node...
Omur Ozel, Kaya Tutuncuoglu, Jing Yang, Sennur Ulu...
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
14 years 3 months ago
Approximability of OFDMA Scheduling
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
Marcel Ochel, Berthold Vöcking
INFOCOM
2006
IEEE
14 years 3 months ago
Session Privacy Enhancement by Traffic Dispersion
— Traditional network routing uses the single (shortest) path paradigm. This paradigm leaves the session vulnerable to a variety of security threats, such as eavesdropping. We pr...
Haim Zlatokrilov, Hanoch Levy
STOC
2010
ACM
269views Algorithms» more  STOC 2010»
14 years 1 months ago
Approximations for the Isoperimetric and Spectral Profile of Graphs and Related Parameters
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
Prasad Raghavendra, David Steurer and Prasad Tetal...
JMLR
2008
230views more  JMLR 2008»
13 years 9 months ago
Exponentiated Gradient Algorithms for Conditional Random Fields and Max-Margin Markov Networks
Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of...
Michael Collins, Amir Globerson, Terry Koo, Xavier...