Publication Search Results

TitleAuthorBibliographicsort descendingDateGroupLinks
Scalable Session Messages in SRMP. Sharma, D. Estrin, S. Floyd, and L. ZhangTechnical reportFebruary 1998Networking
Ns Simulator Tests for Random Early Detection (RED) GatewaysS. FloydTechnical ReportOctober 1996Networking
Comments on Measurement-based Admissions Control for Controlled-Load ServicesS. FloydTechnical ReportJuly 1996Networking
Issues of TCP with SACKS. FloydTechnical reportJanuary 1996Networking[PDF]

On Characterizing Network Topologies and Analyzing Their Impact on Protocol DesignP. Radoslavov, H. Tangmunarunkit, H. Yu, R. Govindan, S. Shenker, and D. EstrinTechnical Report 00-731, Computer Science Department, University of Southern California, February 2000.February 2000Networking
Switchboard-DAMSL Labeling Project Coder's ManualD. Jurafsky, E. Shriberg, and D. BiascaTechnical Report 97-02, University of Colorado, Institute of Cognitive Science, Boulder, Colorado 1997Speech[PDF]

Architectural Considerations for Playback of Quality Adaptive Video over the InternetR. Rejaie, M. Handley, and D. EstrinTechnical report 98-686, Computer Science Department, University of Southern California 1998Networking
Exploiting the Bandwidth-Memory Tradeoff in Multicast State AggregationP. Radoslavov, D. Estrin, and R. GovindanTechnical Report 99-697, Computer Science Department, University of Southern California, July 1999.July 1999Networking
Fixing Two BSD TCP BugsM. AllmanTechnical Report CR-204151, NASA Lewis Research CenterOctober 1997Networking
FTP Extensions for Variable Protocol SpecificationM. Allman and S. OstermannTechnical Report CR-209414, NASA Glenn Research Center, February 2000.February 2000Networking
Advantages of Parallel Processing and the Effects of Communications TimeW. Eddy and M. AllmanTechnical Report CR-209455, NASA Glenn Research Center, February 2000.February 2000Networking
A Swifter Start for TCPC. Partridge, D. Rockwell, M. Allman, R. Krishnan, and J.P.G. SterbenzTechnical Report No. 8339, BBN Technologies, March 2002March 2002Networking
Multiple Data Connection FTP ExtensionsM. Allman and S. OstermannTechnical Report TR-19971, Ohio University Computer ScienceFebruary 1997Networking
ONE: The Ohio Network EmulatorM. Allman, A. Caldwell, and S. OstermannTechnical Report TR-19972, Ohio University Computer Science DepartmentAugust 1997Networking
A Branch and Cut Algorithm for the Optimal Solution of the Side Chain Placement ProblemE. Althaus, O. Kohlbacher, H.P. Lenhof, and P. MullerTechnical Report Vol.2000-1-001, Max-Planck-Institut fur Informatik: Foschungsbericht, 2000. 2000Algorithms
Exploiting Independent State For Network Intrusion DetectionR. Sommer and V. PaxsonTechnische Universität München Technical Report No. TUM-I0420, Munich, GermanyNovember 2004Networking[PDF]

Early-stage practicalities of implementing computer aided education: Experience from IndiaJ. PalTEDC2006 - Technology and Education in Developing Countries, Iringa, TanzaniaJuly 12 2006BCIS (archived)
Question Answering based on Semantic StructuresS. Narayanan and S. HarabagiuThe 20th International Conference on Computational Linguistics (COLING 2004), Geneva, SwitzerlandAugust 2004AI
Recognizing Reverberant Speech With RASTA-PLPB. Kingsbury and N. MorganThe 22nd International Conference on Acoustics, Speech, and Signal Processing (ICASSP 1997), Munich, Germany, Vol. 2, pp. 1259-1262April 1997Speech[PDF]

The Weft: A Representation for Periodic SoundsD. EllisThe 22nd International Conference on Acoustics, Speech, and Signal Processing (ICASSP 1997), Munich, Germany, Vol. 2, pp. 1307-1310April 1997Speech[PDF]

Integrating Syllable Boundary Information Into Speech RecognitionS.L. Wu, M. Shire, S. Greenberg, and N. MorganThe 22nd International Conference on Acoustics, Speech, and Signal Processing (ICASSP 1997), Munich, Germany, Vol. 2, pp. 987-990April 1997Speech[PDF]

The Modulation Spectrogram: In Pursuit of an Invariant Representation of SpeechS. Greenberg and B. KingsburyThe 22nd International Conference on Acoustics, Speech, and Signal Processing (ICASSP 1997), Munich, Germany, Vol. 3, pp. 1647-1650April 1997Speech[PDF]

A Best-Fit Approach to Productive Omission of ArgumentsE. Mok and J. BryantThe 32nd Annual Meeting of the Berkeley Linguistics Society, Berkeley, CaliforniaFebruary 2006AI[PDF]

Automatic Labeling of Semantic RolesD. Gildea and D. JurafskyThe 38th Annual Meeting of the Association for Computational Linguistics (ACL-2000), Hong Kong, pp. 512-520October 2000Speech[PDF]

Estimating Local Ancestry in Admixed PopulationsS. Sankararaman, S. Sridhar, G. Kimmel, and E. HalperinThe American Journal of Human Genetics, Vol. 82, Issue 2, pp. 290-303February 2008Algorithms[PDF]

Leveraging Genetic Variability Across Populations for the Identification of Causal VariantsN. Zaitlen, B. Pasaniuc, T. Gur, E. Zic, and E. HalperinThe American Journal of Human Genetics, Vol. 86, Issue 1, pp. 23-33January 2010Algorithms
The Spread of the Sapphire/Slammer WormD. Moore, V. Paxson, S. Savage, C. Shannon, S. Staniford, and N. WeaverThe Cooperative Association for Internet Data Analysis Technical ReportFebruary 2003Networking
Associative LanguagesJ.A. FeldmanThe Encyclopedia of Computer Science and Technology, A. Ralston (ed.) 1973AI
Internet Indirection InfrastructureI. Stoica, D. Adkins, S. Ratnasamy, S. Shenker, S. Surana, and S. ZhuangThe First International Workshop on Peer-to-Peer Systems (IPTPS): 191-202, 2002. 2002Networking
Complex Queries in DHT-based Peer-to-Peer NetworksM. Harren, J.M. Hellerstein, R. Huebsch, B.T. Loo, S. Shenker, and I. StoicaThe First International Workshop on Peer-to-Peer Systems (IPTPS): 242-259, 2002. 2002Networking
Routing Algorithms for DHTs: Some Open QuestionsS. Ratnasamy, I. Stoica, and S. ShenkerThe First International Workshop on Peer-to-Peer Systems (IPTPS): 45-52, 2002. 2002Networking
Can Heterogeneity Make Gnutella Scalable?Q. Lv, S. Ratnasamy, and S. ShenkerThe First International Workshop on Peer-to-Peer Systems (IPTPS): 94-103, 2002. 2002Networking
Chapter 17: The Transcription of DiscourseJ. EdwardsThe Handbook of Discourse Analysis, D. Shriffrin, D. Tannen and H. Hamilton, eds. Oxford: Blackwell, pp. 321-348 2001Speech
Connectionist Speech Recognition: A Hybrid ApproachH. Bourlard and N. MorganThe Kluwer International Series in Engineering and Computer Science; v. 247, Boston: Kluwer Academic Publishers 1993Speech
An Interview with Prof. Charles J. FillmoreY. Hasegawa and K. OharaThe Rising Generation, Vol. 152, No. 6, pp. 34-39 (in Japanese)August 2006AI
Universality of Frames: Evidence from English-to-Japanese TranslationY. Hasegawa, R. Lee-Goldman, and C. J. FillmoreThe Socio-Pragmatics of Frame Semantics and Construction Grammar. Amsterdam, J.-O. Ostman and M. Fried, eds., John Benjamins 2011AI
On Approximating Optimal AuctionsA. RonenThe Third ACM Conference on Electronic Commerce (EC01), 11-17, 2001. 2001Algorithms
A Comparison of the AES Candidates Amenability to FPGA ImplementationN. Weaver and J. WawrzynekThe Third Advanced Encryption Standard (AES) Candidate Conference, 2000. 2000Networking
Hardness Results for Multicast Cost SharingJ. Feigenbaum, A. Krishnamurthy, R. Sami, and S. ShenkerTheoretical Computer Science, Vol. 304, Issues 1-3, pp. 215-236July 2003Networking
Computing the Similarity of Two Sequences with Nested Arc AnnotationsJ. Alber, J. Gramm, J. Guo, and R. NiedermeierTheoretical Computer Science, Vol. 312, Issues 2-3, pp. 337-358January 2004Algorithms
Performance Aspects of Distributed Caches Using TTL-Based ConsistencyE. Cohen, E. Halperin, and H. KaplanTheoretical Computer Science, Vol. 331, Issue 1, pp. 73-96February 2005Algorithms
The Minimum-Entropy Set Cover ProblemE. Halperin and R. M. KarpTheoretical Computer Science, Vol. 348, Issue 2, pp. 240-250December 2005Algorithms
On the Runtime and Robustness of Randomized BroadcastingR. Elsässer and T. SauerwaldTheoretical Computer Science, Vol. 410, Issue 36, pp. 3414-3427August 2009Algorithms[PDF]

Plateaus Can Be Harder in Multi-Objective OptimizationT. Friedrich, N. Hebbinghaus, and F. NeumannTheoretical Computer Science, Vol. 411, Issue 6, pp. 854-864February 2010Algorithms[PDF]

A Self-Stabilizing Algorithm for Cut Problems in Synchronous NetworksT. Sauerwald and D. SudholtTheoretical Computer Science, Vol. 411, Issues 14-15, pp. 1599-1612March 2010Algorithms
Optimal Flow Distribution Among Multiple Channels with Unknown CapacitiesR. M. Karp, T. Nierhoff, and T. TantauTheoretical Computer Science: Essays in Memory of Shimon Even, O. Goldreich, A. L. Rosenberg, and A. L. Selman, eds., Lecture Notes in Computer Science, Vol. 3895, pp. 111-128, Springer-Verlag 2006Algorithms[PDF]

Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique GenerationJ. Gramm, J. Guo, F. Hüffner, and R. NiedermeierTheory of Computing SystemsJanuary 05 2004Algorithms
Parameterized Intractability of Distinguishing Substring SelectionJ. Gramm, J. Guo, and R. NiedermeierTheory of Computing SystemsJanuary 05 2004Algorithms
Approximation Algorithms for Data Management in NetworksC. Krick, H. Racke, and M. WestermannTheory of Computing Systems, 2001. 2001Algorithms
Comparing Verboseness for Finite Automata and Turing MachinesT. TantauTheory of Computing Systems, Vol. 31, No. 1, pp. 95-109January 05 2004Algorithms

Pages