Sciweavers

315 search results - page 62 / 63
» Eigenvalue bounds for independent sets
Sort
View
CORR
2008
Springer
85views Education» more  CORR 2008»
13 years 6 months ago
Online Scheduling to Minimize the Maximum Delay Factor
In this paper two scheduling models are addressed. First is the standard model (unicast) where requests (or jobs) are independent. The other is the broadcast model where broadcast...
Chandra Chekuri, Benjamin Moseley
JCSS
2008
138views more  JCSS 2008»
13 years 6 months ago
Reducing mechanism design to algorithm design via machine learning
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
Maria-Florina Balcan, Avrim Blum, Jason D. Hartlin...
EJC
2007
13 years 6 months ago
Deterministic random walks on the integers
Jim Propp’s P-machine, also known as the ‘rotor router model’ is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to ran...
Joshua N. Cooper, Benjamin Doerr, Joel H. Spencer,...
BMCBI
2005
122views more  BMCBI 2005»
13 years 5 months ago
Quantitative analysis of EGR proteins binding to DNA: assessing additivity in both the binding site and the protein
Background: Recognition codes for protein-DNA interactions typically assume that the interacting positions contribute additively to the binding energy. While this is known to not ...
Jiajian Liu, Gary D. Stormo
GLOBECOM
2010
IEEE
13 years 4 months ago
A Distributed Wake-Up Scheduling for Opportunistic Forwarding in Wireless Sensor Networks
In wireless sensor networks (WSNs), sensor nodes are typically subjected to energy constraints and often prone to topology changes. While duty cycling has been widely used for ener...
Chul-Ho Lee, Do Young Eun