Advanced Search
DSpace@MIT

Browsing MIT Open Access Articles by Title

Research and Teaching Output of the MIT Community

Browsing MIT Open Access Articles by Title

Sort by: Order: Results:

  • Orlin, James B.; Madduri, Kamesh; Subramani, K.; Williamson, M. (Elsevier, 2010-06)
    In this paper, we propose an efficient method for implementing Dijkstra's algorithm for the Single Source Shortest Path Problem (SSSPP) in a graph whose edges have positive length, and where there are few distinct edge ...
  • Miller, Gary L.; Peng, Richard; Kelner, Jonathan Adam (Association for Computing Machinery (ACM), 2012-05)
    The maximum multicommodity flow problem is a natural generalization of the maximum flow problem to route multiple distinct flows. Obtaining a 1-ε approximation to the multicommodity flow problem on graphs is a well-studied ...
  • Kelner, Jonathan Adam; Madry, Aleksander (Institute of Electrical and Electronics Engineers, 2010-03)
    In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is within a multiplicative (1+ d) of uniform in ...
  • Hassanieh, Haitham; Adib, Fadel M.; Katabi, Dina; Indyk, Piotr (Association for Computing Machinery, 2012-08)
    GPS is one of the most widely used wireless systems. A GPS receiver has to lock on the satellite signals to calculate its position. The process of locking on the satellites is quite costly and requires hundreds of millions ...
  • Haeupler, Bernhard; Karger, David R. (Association for Computing Machinery (ACM), 2011-06)
    We use network coding to improve the speed of distributed computation in the dynamic network model of Kuhn, Lynch and Oshman [STOC '10]. In this model an adversary adaptively chooses a new network topology in every round, ...
  • Xiao, Lin; Diaconis, Persi; Boyd, Stephen P.; Parrilo, Pablo A. (Society for Industrial and Applied Mathematics, 2009-06)
    We show how to exploit symmetries of a graph to efficiently compute the fastest mixing Markov chain on the graph (i.e., find the transition probabilities on the edges to minimize the second-largest eigenvalue modulus of ...
  • Tegmark, Max Erik; Zaldarriaga, Matias (American Physical Society, 2009-04)
    We propose an all-digital telescope for 21 cm tomography, which combines key advantages of both single dishes and interferometers. The electric field is digitized by antennas on a rectangular grid, after which a series ...
  • Zou, Ming; De Koninck, Paul; Neve, Rachael L.; Friedrich, Rainer W. (Frontiers Research Foundation, 2014-05)
    The zebrafish has various advantages as a model organism to analyze the structure and function of neural circuits but efficient viruses or other tools for fast gene transfer are lacking. We show that transgenes can be ...
  • Agarwal, Alekh; Negahban, Sahand N.; Wainwright, Martin J. (Institute of Mathematical Statistics, 2012-10)
    Many statistical M-estimators are based on convex optimization problems formed by the combination of a data-dependent loss function with a norm-based regularizer. We analyze the convergence rates of projected gradient and ...
  • Goeke, Robert F.; Hewitt, Jacqueline N.; Morgan, Edward H.; Remillard, Ronald Alan; Williams, Christopher Leigh (IOP Publishing, 2012-10)
    We introduce the Fast Holographic Deconvolution method for analyzing interferometric radio data. Our new method is an extension of A-projection/software-holography/forward modeling analysis techniques and shares their ...
  • Bilgic, Berkin; Horn, Berthold Klaus Paul; Masaki, Ichiro (Institute of Electrical and Electronics Engineers (IEEE), 2010-08)
    We investigate a fast pedestrian localization framework that integrates the cascade-of-rejectors approach with the Histograms of Oriented Gradients (HoG) features on a data parallel architecture. The salient features of ...
  • Bilgic, Berkin; Chatnuntawech, Itthi; Fan, Audrey P.; Setsompop, Kawin; Cauley, Stephen F.; Adalsteinsson, Elfar; Wald, Lawrence (Wiley Blackwell, 2013-11)
    Purpose We introduce L2-regularized reconstruction algorithms with closed-form solutions that achieve dramatic computational speed-up relative to state of the art L1- and L2-based iterative algorithms while maintaining ...
  • Dubbs, Alexander Joseph; Seiler, Brad A.; Magnasco, Marcel O. (MIT Press, 2010-10)
    The metrization of the space of neural responses is an ongoing research program seeking to find natural ways to describe, in geometrical terms, the sets of possible activities in the brain. One component of this program ...
  • Dillon, Joshua Shane; Liu, Adrian Chi-Yan; Tegmark, Max Erik (American Physical Society, 2013-02)
    We develop and demonstrate an acceleration of the Liu and Tegmark quadratic estimator formalism for inverse variance foreground subtraction and power spectrum estimation in 21 cm tomography from O(N[superscript 3]) to ...
  • Jungers, Raphael M.; Protasov, Vladimir Y. (Society for Industrial and Applied Mathematics, 2011-06)
    The $p$-radius characterizes the average rate of growth of norms of matrices in a multiplicative semigroup. This quantity has found several applications in recent years. We raise the question of its computability. We prove ...
  • Mirny, Leonid A.; Mitchison, Timothy J.; Maresca, Tom; Ohi, Ryoma; Groen, Aaron; Needleman, Daniel J. (American Society for Cell Biology, 2010-01)
    Metaphase spindles are steady-state ensembles of microtubules that turn over rapidly and slide poleward in some systems. Since the discovery of dynamic instability in the mid-1980s, models for spindle morphogenesis have ...
  • Pinto, Lucas; Estandian, Daniel; Xu, Min; Lee, Seung-Hee; Feng, Guoping; Dan, Yang; Goard, Michael J.; Kwan, Alex C.; Harrison, Thomas C. (Nature Publishing Group, 2013-10)
    The basal forebrain provides the primary source of cholinergic input to the cortex, and it has a crucial function in promoting wakefulness and arousal. However, whether rapid changes in basal forebrain neuron spiking in ...
  • Hassanieh, Haitham; Mayzel, Maxim; Shi, Lixin; Katabi, Dina; Orekhov, Vadislav Yu (Springer-Verlag, 2015-06)
    Increasing the dimensionality of NMR experiments strongly enhances the spectral resolution and provides invaluable direct information about atomic interactions. However, the price tag is high: long measurement times and ...
  • Perry, Jonathan; Ousterhout, Amy Elizabeth; Balakrishnan, Hari; Shah, Devavrat; Fugal, Hans (Association for Computing Machinery, 2014-08)
    An ideal datacenter network should provide several properties, including low median and tail latency, high utilization (throughput), fair allocation of network resources between users or applications, deadline-aware ...
  • Kedlaya, Kiran S.; Umans, Christopher (Society for Industrial and Applied Mathematics, 2011-12)
    We obtain randomized algorithms for factoring degree n univariate polynomials over $\mathbb{F}_q$ requiring $O(n^{1.5 + o(1)}\,{\rm log}^{1+o(1)} q+ n^{1 + o(1)}\,{\rm log}^{2+o(1)} q)$ bit operations. When ${\rm log}\, q ...
Open Access