2.5k citations
- IBM Research - Thomas J. Watson Research CenterUS27 papers
- California Institute of TechnologyUS9 papers
- Columbia UniversityUS6 papers
- Vassar CollegeUS6 papers
- Stanford UniversityUS5 papers
- University of Illinois Urbana-ChampaignUS5 papers
- Carnegie Mellon UniversityUS4 papers
- Cornell UniversityUS4 papers
- IBM Research - ZurichCH4 papers
- Instituto de Ciencia de Materiales de MadridES4 papers
- University of BristolGB4 papers
- University of MichiganUS4 papers
13 papers · 1 filter
Capacitated Vehicle Routing with Non-Uniform Speeds
Inge Li Gortz, Marco Molinaro, Viswanath Nagarajan +1
The capacitated vehicle routing problem (CVRP) involves distributing (identical) items from a depot to a set of demand locations, using a single capacitated vehicle. We study a gen…
A New Method for Measuring the Upper End of the IMF
Daniela Calzetti, Rupali Chandar, Janice C. Lee +3
A method is presented here for investigating variations in the upper end of the stellar Initial Mass Function (IMF) by probing the production rate of ionizing photons in unresolved…
Graphene photodetectors for high-speed optical communications
Thomas Mueller, Fengnian Xia, Phaedon Avouris
While silicon has dominated solid-state electronics for more than four decades, a variety of new materials have been introduced into photonics to expand the accessible wavelength r…
Intra- and intercellular fluctuations in Min-protein dynamics decrease with cell length
Elisabeth Fischer-Friedrich, Giovanni Meacci, Joe Lutkenhaus +2
Self-organization of proteins in space and time is of crucial importance for the functioning of cellular processes. Often, this organization takes place in the presence of strong r…
Quantifying Information Leakage in Finite Order Deterministic Programs
Ji Zhu, Mudhakar Srivatsa
Information flow analysis is a powerful technique for reasoning about the sensitive information exposed by a program during its execution. While past work has proposed information…
When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings
Nikhil Bansal, Anupam Gupta, Jian Li +3
Consider a random graph model where each possible edge is present independently with some probability . Given these probabilities, we want to build a large/heavy matching…