Advanced Search
DSpace@MIT

Browsing CSAIL Technical Reports (July 1, 2003 - present) by Title

Research and Teaching Output of the MIT Community

Browsing CSAIL Technical Reports (July 1, 2003 - present) by Title

Sort by: Order: Results:

  • Pass, Rafael; Vaikuntanathan, Vinod (2008-04-16)
    We introduce new and general complexity theoretic hardness assumptions. These assumptions abstract out concrete properties of a random oracle and are significantly stronger than traditional cryptographic hardness assumptions; ...
  • Karger, David; Ruhl, Matthias (2003-07-16)
    Load balancing is a critical issue for the efficient operation of peer-to-peer networks. We give new protocols for several scenarios, whose provable performance guarantees are within a constant factor of optimal. First, ...
  • Shrobe, Howard; Laddaga, Robert (2004-02-09)
    Traditionally, we've focussed on the question of how to make a system easy to code the first time, or perhaps on how to ease the system's continued evolution. But if we look at life cycle costs, then we must conclude that ...
  • Andoni, Alexandr; Indyk, Piotr (2005-11-04)
    We present an algorithm for c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time ofO(dn^{1/c^2+o(1)}) and space O(dn + n^{1+1/c^2+o(1)}).
  • Chen, Jing; Micali, Silvio (2008-10-08)
    Following Micali and Valiant [MV07.a], a mechanism is resilient if it achieves its objective without any problem of (1) equilibrium selection and (2) player collusion. To advance resilient mechanism design,We put forward ...
  • Leong, Ben (2006-06-14)
    As wireless sensor networks continue to grow in size, we are facedwith the prospect of emerging wireless networks with hundreds orthousands of nodes. Geographic routing algorithms are a promisingalternative to tradition ...
  • Yang, Xiaowei (2004-10-14)
    The present Internet routing system faces two challengingproblems. First, unlike in the telephone system, Internet users cannotchoose their wide-area Internet service providers (ISPs) separatelyfrom their local access ...
  • rahimi, ali; recht, ben; darrell, trevor (2005-06-06)
    Many high-dimensional time-varying signals can be modeled as a sequence of noisy nonlinear observations of a low-dimensional dynamical process. Given high-dimensional observations and a distribution describing the ...
  • Huang, Albert S.; Teller, Seth (2008-06-06)
    We describe a new method for wide-area, non-metrical robot navigationwhich enables useful, purposeful motion indoors. Our method has twophases: a training phase, in which a human user directs a wheeledrobot with an attached ...
  • Mosci, Sofia; Rosasco, Lorenzo; Santoro, Matteo; Verri, Alessandro; Villa, Silvia (2011-09-26)
    In this work we are interested in the problems of supervised learning and variable selection when the input-output dependence is described by a nonlinear function depending on a few variables. Our goal is to consider a ...
  • De Vito, Ernesto; Belkin, Mikhail; Rosasco, Lorenzo (2008-08-19)
    A large number of learning algorithms, for example, spectral clustering, kernel Principal Components Analysis and many manifold methods are based on estimating eigenvalues and eigenfunctions of operators defined by a ...
  • Rifkin, Ryan M.; Lippert, Ross A. (2007-05-01)
    This is a collection of information about regularized least squares (RLS). The facts here are not “new results”, but we have not seen them usefully collected together before. A key goal of this work is to demonstrate that ...
  • Shakhnarovich, Greg; Bouvrie, Jake; Rosasco, Lorenzo; Smale, Steve (2009-10-09)
    In these notes we focus on the concept of Shannon entropy in an attempt to provide a systematic way of assessing the discrimination properties of the neural response, and quantifying the role played by the number of layers ...
  • Zibin, Yoav; Potanin, Alex; Artzi, Shay; Kiezun, Adam; Ernst, Michael D. (2007-03-16)
    A compiler-checked immutability guarantee provides useful documentation, facilitates reasoning, and enables optimizations. This paper presents Immutability Generic Java (IGJ), a novel language extension that expresses ...
  • Kinsy, Michel; Wen, Tina; Shim, Keun Sup; Lis, Mieszko; Cho, Myong Hyon; Devadas, Srinivas (2009-03-27)
    Oblivious routing can be implemented on simple router hardware, but network performance suffers when routes become congested. Adaptive routing attempts to avoid hot spots by re-routing flows, but requires more complex ...
  • Gilbert, Seth; Guerraoui, Rachid; Newport, Calvin (2006-04-19)
    How much damage can a malicious tiny device cause in a single-hopwireless network? Imagine two players, Alice and Bob, who want toexchange information. Collin, a malicious adversary, wants to preventthem from communicating. ...
  • Fan, Rui; Lynch, Nancy (2006-07-23)
    We prove an $\Omega(n \log n)$ lower bound on the number ofnon-busywaiting memory accesses by any deterministic algorithm solving$n$ process mutual exclusion that communicates via shared registers.The cost of the algorithm ...
  • Marnette, Bruno; Kuncak, Viktor; Rinard, Martin (2005-08-03)
    Typestate systems ensure many desirable properties of imperativeprograms, including initialization of object fields and correct use ofstateful library interfaces. Abstract sets with cardinalityconstraints naturally ...
  • Caponnetto, Andrea; Poggio, Tomaso; Smale, Steve (2008-04-04)
    In this paper we present a class of algorithms for similarity learning on spaces of images. The general framework that we introduce is motivated by some well-known hierarchical pre-processing architectures for object ...
  • Kuncak, Viktor; Rinard, Martin (2004-11-30)
    An important feature of object-oriented programming languages is the ability todynamically instantiate user-defined container data structures such as lists, trees,and hash tables. Programs implement such data structures ...
MIT-Mirage