Browsing Computer Science and Artificial Intelligence Lab (CSAIL) by Title

Now showing items 3800-3804 of 3804

    • Zero-Crossings and Spatiotemporal Interpretation in Vision 

      Poggio, Tomaso; Nielsen, Kenneth; Nishihara, Keith (1982-05-01)
      We will briefly outline a computational theory of the first stages of human vision according to which (a) the retinal image is filtered by a set of centre-surround receptive fields (of about 5 different spatial sizes) ...

    • Zero-Crossings on Lines of Curvature 

      Yuille, A. (1984-12-01)
      We investigate the relations between the structure of the image and events in the geometry of the underlying surface. We introduce some elementary differential geometry and use it to define a coordinate system on the ...

    • ZigZag Decoding: Combating Hidden Terminals in Wireless Networks 

      Katabi, Dina; Gollakota, Shyamnath (2008-04-08)
      This paper presents ZigZag, an 802.11 receiver that combats hidden terminals. ZigZag exploits 802.11 retransmissions which, in the case of hidden terminals, cause successive collisions. Due to asynchrony, these collisions ...

    • ZigZag Decoding: Combating Hidden Terminals In Wireless Networks 

      Katabi, Dina; Gollakota, Shyamnath (2008-10-01)
      This paper presents ZigZag, an 802.11 receiver design that combats hidden terminals. ZigZag's core contribution is a new form of interference cancellation that exploits asynchrony across successive collisions. Specifically, ...

    • Ω(n log n) Lower Bounds on Length of Boolean Formulas 

      Fischer, Michael J.; Meyer, Albert R.; Paterson, Michael S. (1980-11)
      A property of Boolean functions of n variables is described and shown to imply lower bounds as large as Ω(n log n) on the number of literals in any Boolean formula for any function with the property. Formulas over the full ...