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:

  • Helmstaedter, Moritz N.; Briggman, Kevin L.; Denk, Winfried; Bowden, Jared B.; Mendenhall, John M.; Abraham, Wickliffe C.; Harris, Kristen M.; Kasthuri, Narayanan; Hayworth, Kenneth J.; Schalek, Richard; Tapia, Juan Carlos; Lichtman, Jeff W.; Jain, Viren; Bollmann, Benjamin; Richardson, Mark A.; Berger, Daniel R.; Seung, H. Sebastian (Institute of Electrical and Electronics Engineers (IEEE), 2010-06)
    Recent studies have shown that machine learning can improve the accuracy of detecting object boundaries in images. In the standard approach, a boundary detector is trained by minimizing its pixel-level disagreement with ...
  • Borodin, Alexei; Olshanski, Grigori (Elsevier, 2012-05)
    The Gelfand–Tsetlin graph is an infinite graded graph that encodes branching of irreducible characters of the unitary groups. The boundary of the Gelfand–Tsetlin graph has at least three incarnations — as a discrete potential ...
  • Malcolm, Alison E.; Nicholls, David P. (Institute of Physics Publishing, 2011-08)
    The scattering of linear acoustic radiation by a periodic layered structure is a fundamental model in the geosciences as it closely approximates the propagation of pressure waves in the earth's crust. In this contribution, ...
  • Maznev, Alexei (American Physical Society, 2015-04)
    Scattering of normally incident longitudinal and transverse acoustic waves by a randomly rough surface of an elastically isotropic solid is analyzed within the small-perturbation approach. In the limiting case of a large ...
  • Goldwasser, Shafi; Lewko, Allison; Wilson, David A. (Springer-Verlag, 2012-03)
    In this work, we show how to construct IBE schemes that are secure against a bounded number of collusions, starting with underlying PKE schemes which possess linear homomorphisms over their keys. In particular, this enables ...
  • Censor-Hillel, Keren; Haeupler, Bernhard; Lynch, Nancy Ann; Medard, Muriel (2015-04)
    Efficient communication in wireless networks is typically challenged by the possibility of interference among several transmitting nodes. Much important research has been invested in decreasing the number of collisions in ...
  • Censor-Hillel, Keren; Haeupler, Bernhard; Lynch, Nancy Ann; Medard, Muriel (Springer-Verlag, 2012)
    Efficient communication in wireless networks is typically challenged by the possibility of interference among several transmitting nodes. Much important research has been invested in decreasing the number of collisions in ...
  • Vijayaraghavan, Muralidaran; Arvind, Arvind (Institute of Electrical and Electronics Engineers, 2009-08)
    We present a theory for modular refinement of Synchronous Sequential Circuits (SSMs) using Bounded Dataflow Networks (BDNs). We provide a procedure for implementing any SSM into an LI-BDN, a special class of BDNs with some ...
  • Barequet, Gill; Benbernou, Nadia M.; Charlton, David; Demaine, Erik D.; Demaine, Martin L.; Ishaque, Mashhood; Lubiw, Anna; Schulz, Andre; Souvaine, Diane L.; Toussaint, Godfried T.; Winslow, Andrew (University of Manitoba, 2010-08)
    In 1994 Grunbaum [2] showed, given a point set S in R3, that it is always possible to construct a polyhedron whose vertices are exactly S. Such a polyhedron is called a polyhedronization of S. Agarwal et al. [1] extended ...
  • Cikara, Mina; Fiske, Susan T. (MIT Press, 2011-12)
    The current study investigates whether mere stereotypes are sufficient to modulate empathic responses to other people's (mis)fortunes, how these modulations manifest in the brain, and whether affective and neural responses ...
  • Dennis, Gregory D.; Yessenov, Kuat T.; Jackson, Daniel (Springer Berlin Heidelberg, 2008-09)
    We present a case-study in which vote-tallying software is analyzed using a bounded verification technique, whereby all executions of a procedure are exhaustively examined within a finite space given by a bound on the size ...
  • Baer, Eric; Vasseur, Alexis (Society for Industrial and Applied Mathematics, 2013-07)
    We give a uniform bound from below on the temperature for a variant of the compressible Navier-Stokes--Fourier system, under suitable hypotheses. This system of equations forms a mathematical model of the motion of a ...
  • Shkolnik, Alexander C.; Levashov, Michael; Manchester, Ian R.; Tedrake, Russell Louis (Sage, 2010-12)
    A motion planning algorithm is described for bounding over rough terrain with the LittleDog robot. Unlike walking gaits, bounding is highly dynamic and cannot be planned with quasi-steady approximations. LittleDog is modeled ...
  • Geneson, Jesse; Prasad, Rohil; Tidor, Jonathan (Electronic Journal of Combinatorics, 2014-08)
    An (r,s)-formation is a concatenation of s permutations of r letters. If u is a sequence with r distinct letters, then let Ex(u,n) be the maximum length of any r-sparse sequence with n distinct letters which has no subsequence ...
  • Sreenivasa Gopalan, Vijay Kumar; Taylor, Washington (Institute of Physics, 2009-12)
    We prove that there are only finitely many distinct semi-simple gauge groups and matter representations possible in consistent 6D chiral (1,0) supergravity theories with one tensor multiplet. The proof relies only on ...
  • Cowan, Ray Franklin; Sciolla, Gabriella; Taylor, Frank E.; Yamamoto, R. K. (American Physical Society, 2004-08)
    We have measured the time-dependent decay rate for the process B→J/ψK[superscript *0](892) in a sample of about 88×10[superscript 6] Υ(4S)→BB̅ decays collected with the BABAR detector at the PEP-II asymmetric-energy B ...
  • England, Philip C.; Walker, Richard T.; Fu, Bihong; Floyd, Mike (Elsevier B.V., 2013-08)
    Palaeoshorelines around four large lakes in central Tibet record a latest-Pleistocene-to-Holocene high stand during which the lakes were filled 150–200 m more deeply than they are at present. GPS measurements of shoreline ...
  • Fox, Jacob; Conlon, David (Springer-Verlag, 2012-08)
    We show, for any positive integer k, that there exists a graph in which any equitable partition of its vertices into k parts has at least ck [superscript 2]/log* k pairs of parts which are not ϵ -regular, where c,ϵ>0 are ...
  • Ghaffari, Mohsen; Haeupler, Bernhard; Newport, Calvin Charles; Lynch, Nancy Ann (Springer-Verlag, 2012)
    The local broadcast problem assumes that processes in a wireless network are provided messages, one by one, that must be delivered to their neighbors. In this paper, we prove tight bounds for this problem in two well-studied ...
  • Medard, Muriel; Christiansen, Mark M.; Duffy, Ken R.; Tessaro, Stefano; Calmon, Flavio du Pin; Varia, Mayank H. (Institute of Electrical and Electronics Engineers (IEEE), 2013-10)
    Lower bounds for the average probability of error of estimating a hidden variable X given an observation of a correlated random variable Y, and Fano's inequality in particular, play a central role in information theory. ...
Open Access