#ID Title Author Bibiographic Year Month Day GroupID Picture PDF Abstract
000001 Automatic Dialog Act Segmentation and Classification in Multiparty Meetings J. Ang, Y. Liu and E. Shriberg 2005 IEEE International Conference on Acoustics, Speech, and Signal
Processing, Philadelphia, PA 2005 __ __ 000001 http://www.icsi.berkeley.edu/ftp/global/pub/speech/papers/icassp2005-da-seg-class.pdf We explore the two related tasks of dialog act (DA) segmentation and DA classification for speech from the ICSI Meeting Corpus. We employ simple lexical and prosodic knowledge sources, and compare results for human-transcribed versus automatically recognized words. Since there is little previous work on DA segmentation and classification in the meeting domain, our study provides baseline performance rates for both tasks. We introduce a range of metrics for use in evaluation, each of which measures different aspects of interest. Results show that both tasks are difficult, particularly for a fully automatic system. We find that a very simple prosodic model aids performance over lexical information alone, especially for segmentation. Both tasks, but particularly word-based segmentation, are degraded by word recognition errors. Finally, while classification results for meeting data show some similarities to previous results for telephone conversations, findings also suggest a potential difference with respect to the effect of modeling DA context.
000002 Tonotopic Multi-Layered Perceptron: A Neural Network for Learning B. Y. Chen, Q. Zhu, N. Morgan 2005 IEEE International Conference on Acoustics, Speech, and Signal 2005 03 03 000001 http://www.icsi.berkeley.edu/ftp/global/pub/speech/papers/icassp2005-chen.pdf
000003 Improved Phonetic Speaker Recognition Using Lattice Decoding A. O. Hatch, B. Peskin, A. Stolcke 2005 IEEE International Conference on Acoustics, Speech, and Signal 2005 03 03 000001 http://www.icsi.berkeley.edu/ftp/global/pub/speech/papers/icassp2005-spkr-phonelats.pdf
000004 Multi-rate and variable-rate modeling of speech at phone and syllable time scales Ozgur Cetin and Mari Ostendorf 2005 IEEE International Conference on Acoustics, Speech, and Signal Processing, Philadelphia, PA 2005 01 03 000001
000005 Speaker Detection Without Models D. Gillick, S. Stafford, B. Peskin 2005 IEEE International Conference on Acoustics, Speech, and Signal
Processing, Philadelphia, PA 2005 03 03 000001 http://www.icsi.berkeley.edu/ftp/global/pub/speech/papers/icassp2005-gillick.pdf In order to capture sequential information and to take advantage of extended training data conditions, we developed an algorithm for speaker detection that scores a test segment by comparing it directly to similar instances of that speech in the training data. This non-parametric technique, though at an early stage in its development, achieves error rates close to 1% on the NIST 2001 Extended Data task and performs extremely well in combination with a standard Gaussian Mixture Model system. We also present a new scoring method that significantly improves performance by capturing only positive evidence.
000006 Modeling Prosodic Feature Sequences for Speaker Recognition E. Shriberg, L. Ferrer, S. Kajarekar, A. Venkataraman, A. Stolcke To appear in Speech Communication 2005 01 03 000001 We describe a novel approach to modeling idiosyncratic prosodic behavior for automatic speaker recognition. The approach computes various duration, pitch, and energy features for each estimated syllable in speech recognition output, quantizes the features, forms N-grams of the quantized values, and models normalized counts for each feature N-gram using support vector machines (SVMs). We refer to these features as "SNERF-grams" (N-grams of Syllable-based Nonuniform Extraction Region Features). Evaluation of SNERF-gram performance is conducted on two-party spontaneous English conversational telephone data from the Fisher corpus, using one conversation side in both training and testing. Results show that SNERF-grams provide significant performance gains when combined with a state-of-the-art baseline system, as well as with two highly successful long-range feature systems that capture word usage and lexically constrained duration patterns. Further experiments examine the relative contributions of features by quantization resolution, N-gram length, and feature type. We find that longer N-grams are better than shorter ones, and that pitch features are most useful, followed by duration and energy features. The most important pitch features are those capturing pitch level, whereas the most important energy features reflect patterns of rising and falling. For duration features, nucleus duration is more important for speaker recognition than are durations from the onset or coda of a syllable. Overall, we find that SVM modeling of prosodic feature sequences yields valuable information for automatic speaker recognition. It also offers rich new opportunities for exploring how speakers differ from each other in voluntary but habitual ways.
000007 Structural Metadata Research in the EARS Program Y. Liu, E. Shriberg, A. Stolcke, B. Peskin, J. Ang, D. Hillard, M. Ostendort, M. Tomalin, P. Woodland, and M. Harper 2005 IEEE International Conference on Acoustics, Speech, and Signal
Processing, Philadelphia, PA 2005 03 __ 000001 http://www.icsi.berkeley.edu/ftp/global/pub/speech/papers/icassp2005-mde.pdf Both human and automatic processing of speech require recognition of more than just words. In this paper we provide a brief overview of research on structural metadata extraction in the DARPA EARS rich transcription program. Tasks include detection of sentence boundaries, filler words, and disfluencies. Modeling approaches combine lexical, prosodic, and syntactic information, using various modeling techniques for knowledge source integration. The performance of these methods is evaluated by task, by data source (broadcast news versus spontaneous telephone conversations) and by whether transcriptions come from humans or from an (errorful) automatic speech recognizer. A representative sample of results shows that combining multiple knowledge sources (words, prosody, syntactic information) is helpful, that prosody is more helpful for news speech than for conversational speech, that word errors significantly impact performance, and that discriminative models generally provide benefit over maximum likelihood models. Important remaining issues, both technical and programmatic, are also discussed.
000008 The ICSI/SRI/UW RT04 Structural Metadata Extraction System Y. Liu, E. Shriberg, A. Stolcke, B. Peskin, M. Harper. RT-04 EARS Workshop 2004 01 03 000001 Both human and automatic processing of speech require recognizing more than just the words. We describe the ICSI-SRI-UW metadata detection system in both broadcast news and spontaneous telephone conversations, developed as part of the DARPA EARS Rich Transcription program. System tasks include sentence boundary detection, filler word detection, and detection/correction of disfluencies. To achieve best performance, we combine information from different types of textual knowledge sources (based on words, part-of-speech classes, and automatically induced classes) with information from a prosodic classifier. The prosodic classifier employs bagging and ensemble approaches to better estimate posterior probabilities. In addition to our previous HMM approach, we investigate using a maximum entropy (Maxent) and a conditional random field (CRF) approach for various tasks. Results using these techniques are presented for the 2004 NIST Rich Transcription metadata tasks.
000009 Structural Event Detection for Rich Transcription of Speech Y. Liu Ph.D Thesis, Purdue University 2004 12 19 000001 http://www.icsi.berkeley.edu/~yangl/thesis.pdf Although speech recognition technology has significantly improved during the past few decades, current speech recognition systems output only a stream of words without providing other useful structural information that could aid a human reader and downstream language processing modules. This thesis research focuses on the automatic detection of several helpful structural events in speech, including sentence boundaries, type of utterance, filled pauses, discourse markers, and edit disfluencies. The systems evaluated combine prosodic cues and textual information sources in a variety of ways to support automatic detection of these structural events. Experiments were conducted across corpora (conversational speech and broadcast news speech) and with different transcription quality (human transcriptions versus recognition output). The imbalanced data problem is investigated for training the decision tree prosody model component of our system because structural events are much less frequent than non-events. A variety of sampling approaches and bagging are used to address this imbalance. Significant performance improvements are obtained via bagging. Some of the sampling methods are useful depending on the performance metrics used. Sentence boundary detection and disfluency detection tasks are impacted differently by sampling, bagging, and boosting, suggesting the inherent differences between the two tasks. A variety of methods for combining knowledge sources are examined: a hidden Markov model (HMM), the maximum entropy (Maxent) model, and the conditional random field (CRF). The Maxent and CRF approaches are discriminatively trained to model the posterior probabilities and thus correlate with the performance measures. They also support the use of more correlated features and so enable the combination of a variety of textual information sources. The HMM and CRF both model sequence information, unlike the Maxent which explicitly models local information. A model that combines these three approaches is superior to any method alone. Interactions with other research efforts suggest that the methods developed in this thesis generalize well to other corpora (e.g., a multimodal corpus, a multiparty meeting corpus) and to similar tasks (e.g., a gestural model, dialog act segmentation and classification).
000010 Computing the Similarity of Two Sequences with Nested Arc Annotations J. Alber, J. Gramm, J. Guo and R. Niedermeier Theoretical Computer Science, 312(2-3):377-358 2004 01 05 000003
000011 Approximation and Collusion in Multicast Cost Sharing A. Archer, J. Feigenbaum, A. Krishnamurthy, R. Sami and S. Shenker Economic Behavior, 47, pp. 3671 2004 01 05 000002
000012 A Layered Naming Architecture for the Internet H. Balakrishnan, K. Lakshminaryanan, S. Ratnasamy, S. Shenker, I. Stoica and M. Walfish Proceedings of SIGCOMMM 2004 01 05 000002
000013 Towards Optimally Multiplexed Applications of Universal Arrays A. Ben-Dor, T. Hartman, R.M. Karp, B. Schwikowski, R. Sharan and Z. Yakhini Journal of Computational Biology 2004 01 05 000003
000014 Using Heriarchical Location Names for Scalable Routing and Rendevous in Wireless Sensor Networks F. Bian, R. Govindan and S. Shenker Submitted to Sensys 2004 01 05 000002
000015 Using TCP DSACKs and SCTP Duplicate TSNs to Detect Spurious Retransmissions E. Blanton and M. Allman RFC 3708 2004 02 05 000002
000016 Text-Constrained Speaker Recognition on a Text-Independent Task K. Boakye and B. Peskin Odyssey 2004 - The Speaker and Language Recognition Workshop, Toledo, Spain 2004 06 05 000001 http://www.icsi.berkeley.edu/ftp/global/pub/speech/papers/spkrodyssey04-kofi.pdf
000017 Scalable Construction-Based Parsing and Semantic Analysis J. Bryant In Proceedings of ScaNaLU-2004, Boston, MA 2004 01 05 000004
000018 Tight Lower Bounds for the Asymetric k-Center Problem J. Chuzhoy, S. Guha, E. Halperin, S. Khanna, G. Kortsarz and S. Naor In Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC04) 2004 01 05 000003
000019 Global Synchronization in Sensornets J. Elson, R.M. Karp, C.H. Papadimitriou and S. Shenker In Proceedings of LATIN, 609-624 2004 01 05 000002
000020 Optimally Phasing Long Genomic Regions using Local Haplotype Predictions E. Eskin, E. Halperin and R. Sharan In Proceedings of the Second RECOMB Satellite Workshop on Computational Methods for SNPs and Haplotypes, pp. 13-16 2004 01 05 000003
000021 Embodied Meaning in a Neural Theory of Language J. Feldman and S. Narayanan Brain and Language 89, pp 385-392, Elsevier Press Incorporated 2004 __ __ 000004
000022 Limited Slow-Start for TCP with Large Congestion Windows S. Floyd RFC 3742, Experimental 2004 03 05 000002
000023 The NewReno Modification to TCP's Fast Recovery Algorithm S. Floyd, T. Henderson and A. Gurtov RFC 3782, Proposed Standard 2004 04 05 000002
000024 IAB Concerns Regarding Congestion Control for Voice Traffic in the Internet S. Floyd and J. Kempf, Editors RFC 3714, Informational 2004 03 05 000002
000025 Speech Recognition Technology H. Franco, F. Beaufays, N. Morgan and H. Bourlard Chapter in Handbook of Brain Theory and Neural Networks, 2nd edition, M. Arbib ed. MIT Press 2004 01 05 000001
000026 Identifying Agreement and Disagreement in Conversational Speech: Use of Bayesian Networks to Model Pragmatic Dependencies M. Galley, K. McKeown, J. Hirschberg and E. Shriberg Proceedings of 42nd Meeting of the ACL, July 21-26, Barcelona 2004 07 __ 000001 http://www.icsi.berkeley.edu/ftp/global/pub/speech/papers/acl2004-agreement-bayesian.pdf
000027 Reconstructing Chain Functions in Genetic Networks I. Gat-Viks, R. Shamir, R.M. Karp and R. Sharan In Proceedings of the Ninth Pacific Symposium on Biocomputing (PSB'04), pp. 498-509 2004 01 05 000003
000028 Load Balancing in Dynamic Structured P2P Systems B. Godfrey, R.M. Karp, K. Lakshminarayanan, S. Surana and I. Stoica Proceedings of INFOCOMM 2004 01 05 000003
000029 A polynomial-time algorithm for the matching of crossing contact-map patterns J. Gramm In Proceedings of the 4th International Workshop on Algorithms in Bioinformatics (WABI 2004), Bergen, Norway 2004 09 05 000003
000030 Experimental Design for Multiplexed SNP Genotyping J. Gramm, A. Ben-Dor and R. Sharan Manuscript 2004 01 05 000003
000031 Graph-modeled data clustering: fixed-parameter algorithms for clique generation J. Gramm, J. Guo, F. Hüffner and R. Niedermeier Theory of Computing Systems 2004 01 05 000003
000032 Automated generation of search tree algorithms for hard graph-modification problems J. Gramm, J. Guo, F. Hüffner and R. Niedermeier Algorithmica, 39(4):321-347 2004 01 05 000003
000033 Parameterized Intractability of Distinguishing Substring Selection J. Gramm, J. Guo and R. Niedermeier Theory of Computing Systems 2004 01 05 000003
000034 Pattern matching for arc-annotated sequences J. Gramm, J. Guo and R. Niedermeier Journal of Algorithms 2004 01 05 000003
000035 On the Complexity of Haplotyping via Perfect Phylogeny J. Gramm, T. Nierhoff, R. Sharan and T. Tantau In Proceedings of the Second RECOMB Satellite Workshop on Computational Methods for SNPs and Haplotypes, pp. 35-46 2004 01 05 000003
000036 Perfect Path Phylogeny Haplotyping with Missing Data is Fixed-Parameter Tractable J. Gramm, T. Nierhoff and T. Tantau In Proceedings of the First International Workshop on Parameterized and Exact Computation (IWPEC 2004), Bergen, Norway 2004 09 05 000003
000037 Haplotype Reconstruction from Genotype Data Using Imperfect Phylogeny E. Halperin and E. Eskin Bioinformatics 2004 01 05 000003
000038 Perfect Phylogeny and Haplotype Assignment E. Halperin and R.M. Karp In Proceedings of RECOMB 2004 01 05 000003
000039 The Minimum-Entropy Set Cover Problem E. Halperin and R.M. Karp In Proceedings of ICALP 2004 01 05 000003
000040 Color naming lens aging and grue: What the optics of the aging eye can teach us about color language J. Hardy, C. Frederick, P. Kay and J. Werner Psychological Science 2004 01 05 000004
000041 A 1.5-Approximation Algorithm for Sorting by Transpositions and Transversals T. Hartman and R. Sharan In Proceedings of WABI 2004 09 05 000003
000042 Desperately Seeking Impostors: Data-Mining for Competitive Impostor Testing in a Text-Dependent Speaker Verification System M. Hebert and N. Mirghafori In Proceedings of IEEE ICASSP, Montreal 2004 05 05 000001 http://www.icsi.berkeley.edu/~nikki/papers/lev_icassp04.pdf
000043 Show what you know: musings on the reporting of negative results in speech recognition research H. Hermansky and N. Morgan Journal of Negative Results in Speech and Audio Sciences 2004 01 05 000001 http://journal.speech.cs.cmu.edu/
000044 Improving Automatic Sentence Boundary Detection with Confusion Networks D. Hillard, M. Ostendorf, A. Stolcke, Y. Liu and E. Shriberg In Proceedings of HLT-NAACL Conference, Boston 2004 04 05 000001 http://www.icsi.berkeley.edu/ftp/global/pub/speech/papers/hlt2004-su-nets.pdf
000045 The ICSI Meeting Project: Resources and Research A. Janin, J. Ang, S. Bhagat, R. Dhillon, J. Edwards, J. Macias-Guarasa, N. Morgan, B. Peskin, E. Shriberg, A. Stolcke, C. Wooters and B. Wrede NIST ICASSP 2004 Meeting Recognition Workshop, Montreal 2004 05 05 000001 http://www.icsi.berkeley.edu/ftp/global/pub/speech/papers/nist2004-meeting-janin.pdf
000046 Fast Portscan Detection Using Sequention Hypothesis Testing J. Jung, V. Paxson, A. Berger and H. Balakrishnan Proceedings of IEEE Symposium on Security and Privacy 2004 05 05 000002
000047 Spurring the Adoption of DHTs with OpenHash B. Karp, S. Ratnasamy, S. Rhea and S. Shenker In Third International Workshop on Peer-to-Peer Systems (IPTPS) 2004 01 05 000002
000048 Finite-Length Analysis of LT-codes R.M. Karp, M. Luby and A. Shokrollahi In Proceedings of International Symposium on Information Theory (ISIT) 2004 01 05 000003
000049 Color categories are not arbitrary P. Kay Journal of Cross-Cultural Research 2004 01 05 000004
000050 Pragmatic Aspects of Grammatical Constructions P. Kay In L. Horn and G. Ward, eds., Hanbook of Pragmatics, Oxford and London: Blackwell 2004 01 05 000004
000051 Argument Constructions and the Argument-Adjunct Distinction P. Kay H. Boas and M. Fried, eds, Construction Grammar: Back to the Roots. Amsterdam: John Benjamins 2005 01 05 000004
000052 PathBLAST: A tool for alignment of protein interaction networks B.P. Kelley, B. Yuan, F. Lewitter, R. Sharan, B.R. Stockwell and T. Ideker Nucleic Acids Research 32, pp. W83-W88 2004 01 05 000003
000053 Practical and Robust Geographic Routing in Wireless Networks Y. Kim, R. Govindan, B. Karp and S. Shenker Submitted to Mobicom 2004 01 05 000002
000054 Computational Problems in Noisy SNP and Haplotype Analysis: Block Scores, Block Identification and Population Stratification G. Kimmel, R. Sharan and R. Shamir INFORMS Journal on Computing, in press 2004 01 05 000003
000055 Explicit Transport Error Notification (ETEN) for Error-Prone Wireless and Satellite Networks R. Krishnan, J. Sterbenz, W. Eddy, C. Partridge and M. Allman Computer Networks, 46(3), October 2004. 2004 10 __ 000002 Wireless and satellite networks often have non-negligible packet corruption rates that can significantly degrade TCP performance. This is due to TCP's assumption that every packet loss is an indication of network congestion (causing TCP to reduce the transmission rate). This problem has received much attention in the literature. In this paper, we take a broad look at the problem of enhancing TCP performance under corruption losses, and include a discussion of the key issues. The main contributions of this paper are: (i) a confirmation of previous studies that show the reduction of TCP performance in the face of corruption loss, and in addition a plausible upper bound achievable with perfect knowledge of the cause of loss, (ii) a classification of the potential mitigation space, and (iii) the introduction of a promising new mitigation that employs rich cumulative information from intermediate nodes in a path to form a better congestion response. We first illustrate the performance implications of corruption-based loss for a variety of networks via simulation. In addition, we show a rough upper bound on the performance gains a TCP could get if it could perfectly determine the cause of each segment loss -- independent of any specific mechanism for TCP to learn the root cause of packet loss. Next, we provide a taxonomy of potential practical classes of mitigations that TCP end-points and intermediate network elements can cooperatively use to decrease the performance impact of corruption-based loss. Finally, we briefly consider a potential mitigation, called cumulative explicit transport error notification (CETEN), which covers a portion of the solution space previously unexplored. CETEN is shown to be a promising mitigation strategy, but a strategy with numerous formidable practical hurdles still to overcome. Wesley Eddy, Shawn Ostermann, Mark Allman. New Techniques for Making Transport Protocols Robust to Corruption-Based Loss. ACM Computer Communication Review, 34(5), October 2004. Abstract: Current congestion control algorithms treat packet loss as an indication of network congestion, under the assumption that most losses are caused by router queues overflowing. In response to losses (congestion), a sender reduces its sending rate in an effort to reduce contention for shared network resources. In network paths where a non-negligible portion of loss is caused by packet corruption, performance can suffer due to needless reductions of the sending rate (in response to ``perceived congestion'' that is not really happening). This paper explores a technique, called Cumulative Explicit Transport Error Notification (CETEN), that uses information provided by the network to bring the transport's long-term average sending rate closer to that dictated by only congestion-based losses. We discuss several ways that information about the cumulative rates of packet loss due to congestion and corruption might be obtained from the network or through fairly generic transport layer instrumentation. We then explore two ways to use this information to develop a more appropriate congestion control response (CETEN). The work in this paper is done in terms of TCP. Since numerous transport protocols use TCP-like congestion control schemes, the CETEN techniques we present are applicable to other transports as well. In this paper, we present early simulation results that show CETEN to be a promising technique. In addition, this paper discusses a number of practical and thorny implementation issues associated with CETEN. Alberto Medina, Mark Allman, Sally Floyd. Measuring Interactions Between Transport Protocols and Middleboxes. ACM SIGCOMM/USENIX Internet Measurement Conference, Taormina, Sicily, Italy, October 2004. Abstract: In this paper we explore the current network environment with respect to how the network's evolution ultimately impacts end-to-end protocols. The traditional end-to-end assumptions about the Internet are increasingly challenged by the introduction of intermediary network elements (middleboxes) that intentionally or unintentionally prevent or alter the behavior of end-to-end communications. This paper provides measurement results showing the impact of the current network environment on a number of traditional and proposed protocol mechanisms (e.g., Path MTU Discovery, Explicit Congestion Notification, etc.). We present results of measurements taken using an active measurement framework to study web servers. We analyze our results to gain further understanding of the differences between the behavior of the Internet in theory versus the behavior we observed through measurements. In addition, these measurements can be used to guide the definition of more realistic Internet modeling scenarios.
000056 Routing as a Service K. Lakshminarayanan, I. Stoica and S. Shenker Preprint 2004 2004 01 05 000002
000057 Trickle: A Self-Regulation Algorithm for Code Propogation and Maintenance in Wireless Sensor Networks P. Levis, N. Patel, D. Culler and S. Shenker NSDI 2004 01 05 000002
000058 Comparing and Combining Generative and Posterior Probability Models: Some Advances in Sentence Boundary Detection in Speech Y. Liu, A. Stolcke, E. Shriberg and M. Harper In Proceedings of Conference on Empirical Methods in Natural Language Processing, Barcelona 2004 07 __ 000001 http://www.icsi.berkeley.edu/ftp/global/pub/speech/papers/emnlp2004-maxent.pdf
000059 Parameterization of the Score Threshold for a Text-Dependent Adaptive Speaker Verification System N. Mirghafori and M. Hebert In Proceedings of IEEE ICASSP, Montreal 2004 05 05 000001 http://www.icsi.berkeley.edu/~nikki/papers/fcdt_icassp04.pdf
000060 Scaling Understanding up to Mental Spaces E. Mok, J. Bryant and J.A. Feldman In Proceedings of ScaNaLU-2004, Boston, MA 2004 01 05 000004
000061 Stochastic direct reinforcement: Representations, recurrence and stochastic games J. Moody, Y. Liu, M. Saffell and K. Youn Submitted for publication, 2004 2004 01 05 000003
000062 Speech Recognition and the Auditory Perspective N. Morgan, H. Bourlard and H. Hermansky Chapter in Speech Processing in the Auditory System, S. Greenberg and W. Ainsworth, eds, Springer 2004 01 05 000001
000064 TRAPping Conversational Speech: Extending TRAP/Tandem approaches to conversational telephone speech recognition N. Morgan, B. Y. Chen, Q. Zhu, and A. Stolcke In Proceedings of IEEE ICASSP, Montreal 2004 05 05 000001 http://www.icsi.berkeley.edu/ftp/global/pub/speech/papers/icassp04-cts.pdf
000065 CPRM: An expressive probabilistic framework for reasoning about event structure S. Narayanan and J. Feldman Submitted for publication, 2004 2004 __ __ 000004
000066 On the Reducibility of Sets Inside with Low Information Content M. Ogihara and T. Tantau in JCSS 2004 01 05 000003
000067 Incomplete Directed Perfect Phylogeny I. Pe'er, T. Pupko, R. Shamir and R. Sharan SIAM Journal on Computing 33(3), pp. 590-607 2004 01 05 000003
000068 Time delay based failure-robust direction of arrival estimation T. Pirinen and J. Yli-Hietanen Proceedings of IEEE SAM 2004, Sitges, Barcelona, Spain 2004 07 05 000001 http://www.cs.tut.fi/sgn/arg/tuomop/sam2004.pdf
000069 Detection and compensation of sensor malfunction in time delay based direction of arrival estimation T. Pirinen, J. Yli-Hietanen, P. Pertilä and A. Visa In Proceedings of IEEE ISCAS, Vancouver 2004 05 05 000001 http://www.cs.tut.fi/sgn/arg/tuomop/iscas04.pdf
000070 A Comparison of Application-Level and Router-Assisted Hierarchical Schemes for Reliable Multicast P. Radoslavov, C. Papadopoulos, R. Govindan and D. Estrin IEEE/ACM Transactions on Networking (TON), Volume 12, Issue 3, pp. 469-482 2004 06 05 000002
000071 Prefix Hash Tree: An Indexing Data Structure over Distributed Hash Tables S. Ramabhadran, S. Ratnasamy, J.M. Hellerstein and S. Shenker Submitted to PODC 2004 2004 01 05 000002
000072 Color naming and sunlight T. Regier and P. Kay Psychological Science 15, 288-289 2004 01 05 000004
000073 A Discriminative Model for Identifying Spatial Cis-Regulatory Modules E. Segal and R. Sharan In Proceedings of RECOMB 2004, pp. 141-149; also submitted to Journal of Computational Biology 2004 01 05 000003
000074 Optimal Fully Dynamic Algorithms for Cograph Recognition R. Shamir and R. Sharan Discrete Applied Mathematics 136, pp. 329-340 2004 01 05 000003
000075 Cluster Graph Modification Problems R. Shamir, R. Sharan and D. Tsur Discrete Applied Mathematics 2004 01 05 000003
000076 CREME: Cis-Regulatory Module Explorer for the Human Genome R. Sharan, A. Ben-Hur, G.G. Loots and I. Ovcharenko In Nucleic Acids Research 32, pp. W253-W256 2004 01 05 000003
000077 Multiplexing Schemes for Generic SNP Genotyping Assays R. Sharan, A. Ben-Dor and Z. Yakhini In Proceedings of PSB'04, pp. 140-151 2004 01 05 000003
000078 Identification of Protein Complexes by Comparative Analysis of Yeast and Bacterial Protein Interaction Data R. Sharan, T. Ideker, B.P. Kelley, R. Shamir and R.M. Karp In Proceedings of RECOMB 2004, pp. 282-289 2004 01 05 000002
000079 From Transient Patterns to Persistent Structures: A model of episodic memory formation via cortic-hippocampal interactions L. Shastri Behavioral and Brain Science, in revision 2004 01 05 000004
000080 The ICSI Meeting Recorder Dialog Act (MRDA) Corpus E. Shriberg, R. Dhillon, S. Bhagat, J. Ang, and H. Carvey In Proceedings of HLT-NAACL SIGDIAL Workshop, April-May 2004, Boston 2004 04 05 000001 http://www.icsi.berkeley.edu/ftp/global/pub/speech/papers/hlt04_sigdial_dacorpus.pdf
000081 Progress in Meeting Recognition: The ICSI-SRI-UW Spring 2004 Evaluation System A. Stolcke, C. Wooters, N. Mirghafori, T. Pirinen, I. Bulyko, D. Gelbart, M. Graciarena, S. Otterson, B. Peskin and M. Ostendorf In NIST ICASSP 2004 Meeting Recognition Workshop, Montreal 2004 05 05 000001 http://www.icsi.berkeley.edu/ftp/global/pub/speech/papers/nist2004-meeting-system.pdf
000082 Towards a Next Generation Inter-domain Routing Protocol L. Subramanian, M. Caesar, M. Handley, M Mao, S. Shenker and I. Stoica Preprint 2004 2004 01 05 000002
000083 Listen and Whisper: Security Mechanisms for BGP L. Subramanian, V. Roth, I. Stoica, S. Shenker and R. Katz NSDI 2004 01 05 000002
000084 Revealing Modularity and Organization in the Yeast Molecular Network by Integrated Analysis of Highly Heterogeneous Genome-Wide Data A. Tanay, R. Sharan, M. Kupiec and R. Shamir In Proceedings of the National Academy of Sciences USA 101, pp. 2981-2986 2004 01 05 000003
000085 Comparing Verboseness for Finite Automata and Turing Machines T. Tantau Theory of Computing Systems, Vol. 31, No. 1, pp. 95-109 2004 01 05 000003
000086 A Logspace Approximation Scheme for the Shortest Path Problem for Graphs with Bounded Independence Number T. Tantau In Proceedings of STACS 2004, Lecture Notes on Computer Science, Springer-Verlag 2004 01 05 000003
000087 Untangling the Web from DNS M. Walfish, H. Balakrishnan and S. Shenker NSDI 2004 01 05 000002
000088 Reflections on Witty: Analyzing the Attacker N. Weaver and D. Ellis ;login: pp. 34-37 2004 06 05 000002
000089 Worms vs. Perimeters: The Case for Hard-LANs N. Weaver, D. Ellis, S. Staniford and V. Paxson Hot Interconnects 12 2004 08 05 000002
000090 A Worst-Case Worm N. Weaver and V. Paxson In Proceedings of Third Annual Workshop on Economics and Information Security (WEIS04) 2004 05 05 000002
000091 Very Fast Containment of Scanning Worms N. Weaver, S. Staniford and V. Paxson In Proceedings of USENIX Security Symposium 2004 01 05 000002
000092 The Success of Open Source S. Weber Cambridge, MA, Harvard University Press 2004 __ __ 000005
000093 Connectionist Mechanisms for Cognitive Control C. Wendelken and L. Shastri Submitted for publication, 2004 2004 01 05 000004
000094 Avoiding Forbidden Submatrices by Row Deletions S. Wernicke, J. Alber, J. Gramm, J. Guo and R. Niedermeier In Proceedings of SOFSEM 04, LNCS, Vol. 2832, pp. 349-360, Springer 2004 01 05 000003
000095 The 2004 ICSI-SRI-UW Meeting Recognition System C. Wooters, N. Mirghafori, A. Stolcke, T. Pirinen, I Bulyko, D. Gelbart, M. Graciarena, S. Otterson, B. Peskin and M. Ostendorf In Proceedings of the Joint AMI/Pascal/IM2/M4 Workshop on Meeting Recognition. Also published in Lecture Notes in Computer Science, Volume 3361 / 2005. 2005 01 __ 000001 http://www.icsi.berkeley.edu/ftp/global/pub/speech/papers/meeteval04_amispringer.pdf
000096 MotifPrototyper: A Bayesian Profile Model for Motif Families E.P. Xing and R.M. Karp In Proceedings of the National Academy of Sciences 2004 01 05 000003
000097 Bayesian Haplotype Inference via the Dirichlet Process E.P. Xing, R. Sharan and M.I. Jordan In Proceedings of the Second RECOMB Satellite Workshop on Computational Methods for SNP and Haplotypes, pp. 99-112; Also In Proceedings of ICML 2004 2004 01 05 000003
000098 From Molecule to Metaphor: A Neural Theory of Language J. Feldman Unpublished. Available at ftp://ftp.icsi.berkeley.edu/pub/ai/jfeldman/tech/ 2004 __ __ 000004 ftp://ftp.icsi.berkeley.edu/pub/ai/jfeldman/tech/
000099 On the Impact of Bursting on TCP E. Blanton and M. Allman To appear in Proceedings of the Passive and Active Measurement Workshop, Boston, MA, March 2005 2005 03 __ 000002 Periodically in the transport protocol research community, the idea of introducing a burst mitigation strategy is voiced. In this paper we assess the prevalence and implications of bursts in the context of real TCP traffic in order to better inform a decision on whether TCP's congestion control algorithms need to incorporate some form of burst suppression. After analyzing traffic from three networks, we find that bursts are fairly rare and only large bursts (of hundreds of segments) cause loss in practice.
000100 Towards Robust Speaker Segmentation: The ICSI-SRI Fall 2004 Diarization System C. Wooters, J. Fung, B. Peskin and X. Anguera RT-04F Workshop, Nov. 2004 2004 11 __ 000001 http://www.icsi.berkeley.edu/ftp/global/pub/speech/papers/EARS-RT04f-spkr.pdf
000101 The Contribution of Framenet to Practical Lexicography S. Atkins, M. Rundell and H. Sato International Journal of Lexicography, Volume 16.3: 333-357. 2003. 2003 __ __ 000004
000102 Lexicographic Relevance: Selecting Information From Corpus Evidence S. Atkins, C.J. Fillmore and C.R. Johnson International Journal of Lexicography, Volume 16.3: 251-280. 2003. 2003 __ __ 000004
000103 The Structure of the Framenet Database C.F. Baker, C. J. Fillmore and B. Cronin International Journal of Lexicography, Volume 16.3: 281-296. 2003. 2003 __ __ 000004
000104 The FrameNet Data and Software C.F. Baker and H. Sato Poster and Demonstration at Association for Computational Linguistics, Sapporo, Japan. 2003. 2003 __ __ 000004
000105 Embodied verbal semantics: evidence from an image-verb matching task J. Feldman, B. Bergen and S. Narayanan Proc. Cognitive Science Conference. Boston, August 2003. 2003 08 __ 000004
000106 Connectionism J. Feldman and L. Shastri In Encyclopedia of Cognitive Science, Nature Publishing Group, MacMillan, London, 2003. 2003 __ __ 000004
000107 Background to Framenet C.J. Fillmore, C.R. Johnson and M.R.L. Petruck International Journal of Lexicography, Vol 16.3: 235-250. 2003. 2003 __ __ 000004
000108 FrameNet Glossary C.J. Fillmore and M.R.L. Petruck International Journal of Lexicography, Vol. 16.3: 359-361 2003 __ __ 000004
000109 FrameNet in Action: The Case of Attaching C.J. Fillmore, M.R.L. Petruck, J. Ruppenhofer and A. Wright International Journal of Lexicography, Vol. 16.3: 297-332 2003 __ __ 000004
000110 Semantic Extraction with Wide-Coverage Lexical Resources B. Mohit and S. Narayanan In Marti Hearst and Mari Ostendorf, (eds.) HLT-NAACL 2003: Short Papers. Edmonton, Alberta, Canada, pp. 64-66 2003 __ __ 000004
000111 FrameNet Meets the Semantic Web: Lexical Semantics for the Web S. Narayanan, C. Baker, C. Fillmore and M. Petruck In Fensel, Dieter, Katia Sycara and John Mylopoulos (Eds.) The Semantic Web - ISWC 2003: 771-787. Springer-Verlag, Berlin 2003 __ __ 000004
000112 Analysis and Simulation of Web Services S. Narayanan and S. McIlraith Computer Networks (accepted for publication). 2003 __ __ 000004
000113 Putting FrameNet Data into the ISO Linguistic Annotation FrameWork S. Narayanan, M.R.L. Petruck, C.F. Baker and C.J. Fillmore In Proceedings of the ACL 2003 Workshop on Linguistic Annotation: Getting the Model Right, Sapporo, Japan 2003 __ __ 000004
000114 All in a Day's Week M.R.L. Petruck and H.C. Boas Presentation at Workshop on Frame Semantics. Prague, Czech Republic 2003 07 29 000004
000115 Surprise: Spanish FrameNet! C. Subirats-Rüggeberg and M.R.L. Petruck Presentation at Workshop on Frame Semantics, International Congress of Linguists. Prague, Czech Republic. 2003 07 29 000004
000116 FrameNet's Frames vs. Levin's Verb Classes C.F. Baker and J. Ruppenhofer In J. Larson and M. Paster (Eds.) In Proceedings of the 28th Annual Meeting of the Berkeley Linguistics Society. 27-38 2002 __ __ 000004
000117 Bilingual FrameNet Dictionaries for Machine Translation H.C. Boas In M. González Rodríguez and C. Paz Suárez Araujo (eds.), Proceedings of the Third International Conference on Language Resources and Evaluation. Las Palmas, Spain. Vol. IV: 1364-1371 2002 __ __ 000004
000118 Scaling Cognitive Linguistics: Formalisms for Language Understanding N. Chang, J. Feldman, R. Porzel and K. Sanders Workshop on Scalable Natural Language Understanding. European Media Laboratory. Heidelberg 2002 __ __ 000004
000119 Putting Frames in Perspective N. Chang, S. Narayanan and M.R.L. Petruck Proceedings COLING 2002. Nineteenth International Conference on Computational Linguistics, Taipei, Taiwan 2002 __ __ 000004
000120 From Frames to Inference N. Chang, S. Narayanan and M.R.L. Petruck In Proceedings of the First International Workshop on Scalable Natural Language Understanding, Heidelberg, Germany 2002 __ __ 000004
000121 Herds of Wildebeest, Flasks of Vodka, Heaps of Trouble: An Embodied Construction Grammar Approach to English Measure Phrases E. Dodge and A.C. Wright In J. Larson and M. Paster (Eds.) Proceedings of the 28th Annual Meeting of the Berkeley Linguistics Society: 75-86. 2002 __ __ 000004
000122 The FrameNet Database and Software Tools C.J. Fillmore, C.F. Baker and H. Sato In Proceedings of the Third International Conference on Language Resources and Evaluation (LREC). Las Palmas. 1157-1160. 2002 __ __ 000004
000123 Seeing Arguments through Transparent Structures C.J. Fillmore, C.F. Baker and H. Sato In Proceedings of the Third International Conference on Language Resources and Evaluation (LREC). Las Palmas. 787-91 2002 __ __ 000004
000124 Transparency and Building Lexical Dependency Graphs C.J. Fillmore and H. Sato In J. Larson and M. Paster (eds.) Proceedings of the 28th Annual Meeting of the Berkeley Linguistics Society. 87-99 2002 __ __ 000004
000125 Automatic Labeling of Semantic Roles D. Gildea and D. Jurafsky Computational Linguistics, Vol 28.3: 245-288 2002 __ __ 000004
000126 FrameNet Meets the Semantic Web: A DAML+OIL Frame Representation S. Narayanan, C.J. Fillmore, C.F. Baker and M.R.L. Petruck In Proceedings of the The Eighteenth National Conference on Artificial Intelligence. Edmonton, Canada 2002 __ __ 000004
000127 A new view of the medial temporal lobes and the structure of memory C. Ranganath, L. Shastri and M. D'Esposito ICSI Technical Report TR-02-001 2002 02 __ 000004
000128 Collocational Information in the FrameNet Database J. Ruppenhofer, C.F. Baker and C.J. Fillmore In Braasch, Anna and Claus Povlsen (eds.), Proceedings of the Tenth Euralex International Congress. Copenhagen, Denmark. Vol. I: 359-369 2002 __ __ 000004
000129 The FrameNet Database and Software Tools J. Ruppenhofer, C.F. Baker and C.J. Fillmore In Braasch, Anna and Claus Povlsen (eds.), Proceedings of the Tenth Euralex International Congress. Copenhagen, Denmark. Vol. I: 371-375 2002 __ __ 000004
000130 A Computationally Efficient Abstraction of Long-term Potentiation L. Shastri Neurocomputing. 44-46: 33-41. 2002 __ __ 000004
000131 Episodic memory and cortico-hippocampal interactions L. Shastri Trends in Cognitive Sciences, 6: 162-168 2002 04 __ 000004
000132 Combining belief and utility in a structured connectionist agent architecture C. Wendelken and L. Shastri Proceedings of Cognitive Science 2002, Fairfax, VA 2002 08 __ 000004
000133 The developmental promise of information and communications technology in India J. Pal Contemporary South Asia, Volume 12, Number 1, March 2003. 2003 03 __ 000005
000134 How Much Information J. Pal, P. Lyman, H. Varian, P.F. Charles, N. Good, L. Jordan and K. Swearingen http://www.sims.berkeley.edu/research/projects/how-much-info-2003/ 2003 01 25 000005 http://www.sims.berkeley.edu/research/projects/how-much-info-2003/
000135 The Information Society and the Welfare State: The Finnish Model P. Himanen and M. Castells Oxford University Press, 2002. 2002 __ __ 000005
000136 The Hacker Ethic and the Spirit of the Information Age P. Himanen 2002 __ __ 000005
000137 Bringing devices to the masses: a comparative study of the Brazilian Computador Popular and the Indian Simputer J. Pal with R. Fonseca http://www.sims.berkeley.edu/~joyojeet/Simputer-CP.doc 2003 12 __ 000005 http://www.sims.berkeley.edu/~joyojeet/Simputer-CP.doc The goal of empowering underserved populations to use technology has resulted in hardware solutions worldwide that have been deployed to varying levels of success. Despite the differences in the devices and their technology, their employment, and the benefits motivating the exploration of such solutions, there have been some common threads connecting such projects. The Computador Popular was a project in Brazil to bring computers to the urban poor in Brazil; the Simputer is a mobile computing device made for poor rural populations in India,. Studying these two projects generates some underlying hypotheses about top-down approaches to technology and regional development.
000138 Global Synchronization in Sensornets J. Elson, R.M. Karp, C.H. Papadimitriou and S. Shenker Proceedings of LATIN, 609-624, 2004. 2004 __ __ 000003
000139 Identification of Protein Complexes by Comparative Analysis of Yeast and Bacterial Protein Interaction Data R. Sharan, T. Ideker, B.P. Kelley, R. Shamir and R.M. Karp In Proceedings of the Eighth Annual International Conference on Research in Computational Molecular Biology (RECOMB'04). 2004 __ __ 000003
000140 Coalescing Times for IID Random Variables I. Adler, H.S. Ahn, R.M. Karp and S.M. Ross Random Structures and Algorithms 2003 __ __ 000003
000141 A Stochastic Process on the Hypercube with Applications to Peer to Peer Networks M. Adler, E. Halperin, R.M. Karp and V. Vazirani Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC), 575-584 2003 __ __ 000003
000142 Discovering Local Structure in Gene Expression Data: The Order-Preserving Submatrix Problem. A. Ben-Dor, B. Chor, R.M. Karp and Z. Yakhini Journal of Computational Biology 10(3-4), 385-398 2003 __ __ 000003
000143 Towards Optimally Multiplexed Applications of Universal DNA Tag Systems A. Ben-Dor, T. Hartman, B. Schwikowski, R. Sharan and Z. Yakhini Proceedings of the Seventh Annual International Conference on Research in Computational Molecular Biology (RECOMB'03), ACM Press, 48-56 2003 __ __ 000003
000144 The restriction Scaffold problem A. Ben-Dor, R.M. Karp, B. Schwikowski and R. Shamir Journal of Computational Biology 10(3-4), 385-398 2003 __ __ 000003
000145 A heuristic for the stacker crane problem on trees which is almost surely exact A. Coja-Oghlan, S.O. Krumke and T. Nierhoff In Algorithms and Computation, 14th International Sympsium, ISAAC 2003, LNCS 2906, pp. 605-614, Springer 2003 __ __ 000003
000146 Genome-wide In-silico Determination of Transcriptional Regulation Modules Controlling Cell Cycle in Human Cells R. Elkon, C. Linhart, R. Sharan, R. Shamir and Y. Shiloh Genome Research, 13, pp. 773-780 2003 __ __ 000003
000147 Large Scale Reconstruction of Haplotypes from Genotype Data E. Eskin, E. Halperin and R.M. Karp Proceedings of the 7th Conference on Research in Computational Biology (RECOMB), 104-113 2003 __ __ 000003
000148 Efficient Reconstruction of Haplotype Structure Via Perfect Phylogeny E. Eskin, E. Halperin and R.M. Karp Journal of Bioinformatics and Computational Biology (JBCB) 1(1) 1-20 2003 __ __ 000003
000149 Stock Returns: Momentum, Volatility and Interest Rates Y. Fang, S. Wada and J. Moody In the proceedings of Computational Intelligence in Financial Engineering, IEEE Press 2003 __ __ 000003
000150 An Improved Approximation Algorithm for Vertex Cover with Hard Capacities R. Gandhi, E. Halperin, S. Khuller, G. Kortsarz and A. Srinivasan Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP), 164-175 2003 __ __ 000001 http://hdl.handle.net/1903/1272
000151 Scoring Clustering Solutions by their Biological Relevance I. Gat-Viks, R. Sharan and R. Shamir Bioinformatics, 19,pp 2381-2389 2003 __ __ 000003
000152 Detecting Protein sequences via Metric Embeddings E. Halperin, J. Buhler, R.M. Karp, R. Krauthgamer and B. Westover Proceedings of the Eleventh International Conference on Intelligent Systems for Molecular Biology (ISMB), 122-129 2003 __ __ 000003
000153 Integrality Ratio for Group Steiner Trees and Directed Steiner Trees E. Halperin, G. Kortsarz, R. Krauthgamer, A. Srinivasan and N. Wang Proceedings of the Twelfth Symposium on Discrete Algorithms (SODA), 275-284 2003 __ __ 000003
000154 Polylogarithmic Inapproximability E. Halperin and R. Krauthgamer Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC), 585-594 2003 __ __ 000003
000155 A Gambling Game and its Application to the Analysis of Adaptive Randomized Rounding R.M. Karp and C. Kenyon Springer-Verlag Lecture Notes in Computer Science, Volume 2764 (RANDOM 03), 329-340 2003 __ __ 000003
000156 Load Balancing in Structured P2P Systems R.M. Karp, A. Rao, K. Lakshminarayanan, S. Surana and I. Stoica Proceedings of the Second International Workshop on Peer-to-Peer Systems 2003 __ __ 000003
000157 A Simple Algorithm for Finding Frequent Elements in Streams and Bags R.M. Karp, S. Shenker and C.H. Papadimitriou Transactions on Database Systems 2003 __ __ 000003
000158 Conserved pathways within Bacteria and Yeast as revealed by Global Protein Network Alignment B.P. Kelley, R. Sharan, R.M. Karp, E.T. Sittler, D.E. Root, B.R. Stockwell and T. Ideker Proceedings of the National Academy of Sciences USA, 100, pp. 11394-11399 2003 __ __ 000003
000159 Idetifying Blocks and Sub-Populations in Noisy SNP Data G. Kimmel, R. Sharan and R. Shamir Proceedings of the Third Workshop on Algorithms in Bioinformatics (WABI'03), pp. 303-319 2003 __ __ 000003
000160 Regularizers and Priors for Feed-Forward Networks J. Moody and T. Rognvaldsson Submitted for publication 2003 2003 __ __ 000003
000161 Detecting Excess Radical Replacements in Phylogenetic Trees T. Pupko, R. Sharan, M. Hasegawa, R. Shamir and D. Graur Gene, 319, pp. 127-135 2003 __ __ 000003
000162 Load Balancing in Structured P2P Systems A. Rao, K. Lakshminarayanan. S. Surana, R.M. Karp and I. Stoica In 2nd International Workshop on Peer-to-Peer Systems 2003 __ __ 000003
000163 CLICK and EXPANDER: A System for Clustering and Visualizing Gene Expression Data R. Sharan, A. Maron-Katz and R. Shamir Bioinformatics, 19, pp. 1787-1799 2003 __ __ 000003
000164 CRÈME: A Framework for Identifying Cis-Regulatory Modules in Human-Mouse Conserved Segments R. Sharan, I. Ovcharenko, A. Ben-Hur and R.M. Karp Proceedings of the Eleventh International Conference on Intelligent Systems for Molecular Biology (ISMB'03), Bioinformatics 19, Supplement 1, pp. 1283-1291 2003 __ __ 000003
000165 LOGOS: A Modular Bayesian Model for de novo Motif Detection E.P. Xing, W. Wu, M. Jordan and R.M. Karp Proceedings of IEEE Computer Society Bioinformatic Conference IPTPS 2003 __ __ 000003
000166 The SFRA: A Corner-Turn FPGA Architecture N. Weaver, J. Hauser and J. Wawrzynek to appear at the 12th ACM International Symposium on Field Programmable Gate Arrays (FPGA), February 2004. 2004 02 27 000002 Paper: http://www.cs.berkeley.edu/~nweaver/sfra_fpga_2004.pdf.
000167 Achieving Fairness through Selective Early Dropping J. Scott and R.M. Karp preprint 2004. 2004 __ __ 000002
000168 Finite-Length Analysis of LT-codes R.M. Karp, M. Luby and A. Shokrollahi Submitted to International Symposium on Information Theory (ISIT '04). 2004 __ __ 000002
000169 Load Balancing in Dynamic Structured P2P Systems B. Godfrey, R.M. Karp, K. Lakshminarayanan, S. Surana and I. Stoica Proceedings of INFOCOMM, 2004 2004 __ __ 000002
000170 New Techniques for Making Transport Protocols Robust to Corruption-Based Loss W. Eddy, S. Ostermann and M. Allman January 2004. Accepted for publication. 2004 __ __ 000002
000171 Search Strategies in Inter-Domain Traffic Engineering K. Chandrayana, R.M. Karp, M. Roughan, S. Sen and Y. Zhang preprint 2004 2004 __ __ 000002
000173 A Stochastic Process on the Hypercube with Applications to Peer-to-peer Networks M. Adler, E. Halperin, R.M. Karp and V Vazirani Proceedings of the Thierty-fifth Annual ACM Symposium on Theory of Computing (STOC 2003) 2003 __ __ 000002
000174 On the Performance of Middleboxes M. Allman ACM SIGCOMM/Usenix Internet Measurement Conference, Miami, FL, USA 2003 10 __ 000002
000175 An Evaluation of XML-RPC M. Allman ACM Performance Evaluation Review, 30(4) 2003 03 __ 000002
000176 TCP Congestion Control with Appropriate Byte Counting (ABC) M. Allman RFC 3465 2003 02 __ 000002
000177 Estimating Loss Rates With TCP M. Allman, W. Eddy and S. Ostermann ACM Performance Evaluation Review, 31(3) 2003 12 __ 000002
000178 A Conservative Selective Acknowledgment (SACK)-based Loss Recovery Algorithm for TCP E. Blanton, M. Allman, K. Fall and L. Wang RFC 3517 2003 04 __ 000002
000179 Making Gnutella-like P2P Systems Scalable Y. Chawathe, S. Ratnasamy, L. Breslau and S. Shenker In Proceedings of ACM SIGCOMM 2003 __ __ 000002
000180 A Comparison of RED's Byte and Packet Modes W. Eddy and M. Allman Computer Networks, 42(2) 2003 06 __ 000002
000181 Mechanism Design for Policy Routing J. Feigenbaum, R. Sami and S. Shenker Yale University Technical Report YALEU/DCS/TR-1258 2003 11 __ 000002
000182 HighSpeed TCP for Large Congestion Windows S. Floyd RFC 3649, Experimental 2003 12 __ 000002
000183 TCP Friendly Rate Control (TFRC): Protocol Specification S. Floyd RFC 3446 2003 01 __ 000002
000184 Pktd: A Packet Capture and Injection Daemon J. Gonzalez and V. Paxson Proceedigns of Passive & Active Measurement: PAM-2003 2003 __ __ 000002
000185 DIFS: A Distributed Index for Features in Sensor Networks B. Greenstein, D. Estrin, R. Govindan, S. Ratnasamy and S. Shenker In Elsevier Journal of Ad Hoc Networks, 2003. (Also in the First IEEE Workshop on Sensor Networks Protocols and Applications, SNPA, 2003) 2003 __ __ 000002
000186 The Impact of DHT Routing Geometry on Resilience and Proximity K. Gummadi, R. Gummadi, S. Gribble, S. Ratnasamy, S. Shenker and I. Stoica In Proceedings of ACM SIGCOMM 2003, Karlruhe, Germany 2003 08 __ 000002
000187 Modeling Wireless Links for Transport Protocols A. Gurtov, and S. Floyd to appear in ACM CCR 2003 11 __ 000002
000188 TCP Friendly Rate Control (TFRC): Protocol Specification M. Handley, S. Floyd, J. Pahdye and J. Widmer RFC 3448, Proposed Standard 2003 01 __ 000002
000189 A Framework for Incremental Deployment Strategies for Router-Assisted Services X. He, C. Papadopoulos and P. Radoslavov Proceedings of the IEEE Infocom 2003. San Francisco, CA, USA 2003 04 __ 000002
000190 Querying the Internet with PIER R. Huebsch, J.M. Hellerstein, N. Lanham, B.T. Loo, S. Shenker and I. Stoica In Proceedings of VLDB, 2003, Berlin, Germany 2003 09 __ 000002
000191 A Simple Algorithm for Finding Frequent Elements in Streams and Bags R.M. Karp, S. Shenker and C.H. Papadimitriou Transactions on Database Systems 28: 51-55 2003 __ __ 000002
000192 Patterns of Congestion Collapse T. Kelly, S. Floyd and S. Shenker Under submission 2003 06 __ 000002
000193 Designing DCCP: Congestion Control Without Reliability E. Kohler, M. Handley and S. Floyd ? 2003 05 __ 000002
000194 On the Convergence of Statistical Techniques for Estimating Network Traffic Demands A. Medina, K. Salamatian, N. Taft, I. Matta, Y. Tsang and C. Diot Submitted for publication 2003 2003 02 __ 000002
000195 Inside the Slammer Worm D. Moore, V. Paxson, S. Savage, C. Shannon, S. Staniford and N. Weaver IEEE Magazine of Security and Privacy 2003 08 __ 000002
000196 The Spread of the Sapphire/Slammer Worm D. Moore, V. Paxson, S. Savage, C. Shannon, S. Staniford and N. Weaver Technical Report 2003 02 __ 000002
000197 A High-level Programming Environment for Packet Trace Anonymization and Transformation R. Pang and V. Paxson Proceedings of ACM SIGCOMM 2003 2003 08 __ 000002
000198 On Selfish Routing in Internet-Like Environments L. Qiu, Y.R. Yang, Y. Zhang and S. Shenker In Proceedings of ACM SIGCOMM 2003, Karlsruhe, Germany 2003 08 __ 000002
000199 Load Balancing in Structured P2P Systems A. Rao, K. Lakshminaryanan, S. Surana, R.M. Karp and I. Stoica Proceedings of the Second International Workshop on Peer-to-Peer Systems 2003 __ __ 000002
000200 Geographic Routing without Location Information A. Rao, S. Ratnasamy, C. Papadimitriou, S. Shenker and I. Stoica In Proceedings of ACM MOBICOMM 2003, San Diego, CA 2003 09 __ 000002
000201 Range Queries over DHTs S. Ratnasamy, J.M. Hellerstein and S. Shenker Intel Research Technical Report, IRB-TR-03-011 2003 06 25 000002
000202 Data-Centric Storage in Sensornets with GHT, a Geographic Hash Table S. Ratnasamy, B. Karp, S. Shenker, D. Estrin, R. Gvoindan, L. Yin and F. Yu ACM MONET 2003 __ __ 000002
000203 Active Mapping: Resisting NIDS Evasion Without Altering Traffic U. Shankar and V. Paxson Proceedings of IEEE Symposium on Security and Privacy 2003 05 __ 000002
000204 Enhancing Byte-Level Network Intrusion Detection Signatures with Context R. Sommer and V. Paxson Proceedings of ACM CCS 2003 __ __ 000002
000205 Core-Stateless Fair Queueing: a Scalable Architecture to Approximate Fair Bandwidth Allocations in High-speed Networks I. Stoica, S. Shenker and H. Zhang IEEE/ACM Transactions on Networking 11(1): 33-46. (A previous version appeared in Proceedings of SIGCOMM'98, pp. 118-130, Vancouver, Canada, August 1998.) 2003 __ __ 000002
000206 Post Placement C-slow Retiming for the Xilinx Virtex FPGA N. Weaver, Y. Markovskiy, Y. Patel and J. Wawrzynek 11th ACM Symposium of Field Programmable Gate Arrays (FPGA) 2003 __ __ 000002 http://www.cs.berkeley.edu/~nweaver/papers/Cslow_Retiming_Virtex.pdf
000207 A Taxonomy of Computer Worms N. Weaver, V. Paxson, S. Staniford and R. Cunningham Proceedings of the ACM CCS First Workshop on Rapid Malcode (WORM) 2003 10 __ 000002 http://www.cs.berkeley.edu/~nweaver/papers/taxonomy.pdf
000208 Large Scale Malicious Code: A Research Agenda N. Weaver, V. Paxson, S. Staniford and R. Cunningham DARPA-sponsored report 2003 __ __ 000002
000209 RR-TCP: A Reordering-Robust TCP with DSACK M. Zhang, B. Karp, S. Floyd and L. Peterson ICSI Technical Report TR-02-006, Berkeley, CA, July 2002. Also in 11th IEEE International Conference on Network Protocols (ICNP'03) 2003 11 __ 000002
000210 Host Mobility Using and Internet Indirection Infrastructure S. Zhuang, K. Lai, I. Stoica, R. Katz and S. Shenker In Proceedings of MobiSys '03, pp. 129-144, San Francisco, CA 2003 05 __ 000002
000211 A Robust Speaker Clustering Algorithm J. Ajmera and C. Wooters Proceedings of IEEE Speech Recognition and Understanding Workshop, St. Thomas, U.S. Virgin Islands 2003 12 __ 000001 http://www.icsi.berkeley.edu/ftp/global/pub/speech/papers/asru03-ajmewoot.pdf
000212 Automatically Generated Prosodic Cues to Lexically Ambiguous Dialog Acts in Multiparty Meetings S. Bhagat, H. Carvey and E. Shriberg Proceedings of ICPhS 2003, Barcelona 2003 08 __ 000001 http://www.icsi.berkeley.edu/ftp/global/pub/speech/papers/icphs03-bhagat.pdf
000213 Learning Discriminative Temporal Patterns in Speech: Development of Novel TRAPS-Like Classifiers B. Chen, S. Chang and S. Sivadas Proceedings of EUROSPEECH 2003, Geneva 2003 09 __ 000001 http://www.icsi.berkeley.edu/ftp/global/pub/speech/papers/byc_eur03.pdf
000214 Far-field ASR on Inexpensive Microphones L. Docio-Fernandez, D. Gelbart and N. Morgan Proceedings of EUROSPEECH 2003, Geneva 2003 09 __ 000001 http://www.icsi.berkeley.edu/ftp/global/pub/speech/papers/ldocio_eur03.pdf
000215 Automatic Speech Recognition H. Hermansky and N. Morgan In Encyclopedia of Cognitive Science, Nature Publishing Group, London 2003 __ __ 000001
000216 Data-Driven Speaker and Subword Unit Clustering in Speech Processing M. Hersch EPFL Diploma Thesis, ICSI 2003 03 __ 000001 http://www.icsi.berkeley.edu/ftp/global/pub/speech/papers/thesis03-mhersch.pdf
000217 Detection Of Agreement vs. Disagreement In Meetings: Training With Unlabeled Data D. Hillard, M. Ostendorf and E. Shriberg Proceedings of HLT-NAACL Conference, Edmonton, Canada 2003 05 __ 000001 http://www.icsi.berkeley.edu/ftp/global/pub/speech/papers/hlt03-agree-disagree.pdf
000218 The ICSI Meeting Corpus A. Janin, D. Baron, J. Edwards, D. Ellis, D. Gelbart, N. Morgan, B. Peskin, T. Pfau, E. Shriberg, A. Stolcke and C. Wooters Proceedings of ICASSP-2003, Hong Kong 2003 04 __ 000001 http://www.icsi.berkeley.edu/ftp/global/pub/speech/papers/icassp03-janin.pdf
000219 Word Fragments Identification Using Acoustic-Prosodic Features in Conversational Speech Y. Liu Proceedings of HLT/NAACL, Student Session, Edmonton, Alberta 2003 __ __ 000001
000220 Automatic disfluency identification in conversational speech using multiple knowledge sources Y. Liu, E. Shriberg and A. Stolcke Proceedings of EUROSPEECH 2003, Geneva 2003 09 __ 000001 http://www.icsi.berkeley.edu/ftp/global/pub/speech/papers/eurospeech2003-dfdetect.pdf
000221 Meetings about meetings: research at ICSI on speech in multiparty conversations N. Morgan, D. Baron, S. Bhagat, H. Carvey, R. Dhillon, J. Edwards, D. Gelbart, A. Janin, A. Krupski, B. Peskin, T. Pfau, E. Shriberg, A. Stolcke and C. Wooters Proceedings of ICASSP-2003, Hong Kong 2003 04 __ 000001 http://www.icsi.berkeley.edu/ftp/global/pub/speech/papers/icassp03meetings.pdf
000222 Scaling Up: Learning Large-scale Recognition Methods from Small-scale Recognition Tasks N. Morgan, B. Chen, Q. Zhu and A. Stolcke ICSI Technical Report tr-03-02. Also Special Workshop in Maui(SWIM) paper 218. 2004 __ __ 000001 http://www.icsi.berkeley.edu/ftp/global/pub/speech/papers/swim04-scale.pdf
000223 Using prosodic and conversational features for high-performance speaker recognition: Report from JHU WS'02. B. Peskin, J. Navratil, J. Abramson, D. Jones, D. Klusacek, D. Reynolds and B. Xiang Proceedings of ICASSP-2003, Hong Kong 2003 04 __ 000001 http://www.icsi.berkeley.edu/ftp/global/pub/speech/papers/icassp03-peskin2.pdf
000224 Audio Information Access from Meeting Rooms S. Renals and D. Ellis In Proceedings of ICASSP-2003. Hong Kong 2003 04 __ 000001
000225 The SuperSID Project: Exploiting high-level information for high-accuracy speaker recognition D. Reynolds, W. Andrews, J. Campbell, J. Navratil, B. Peskin, A. Adami, Q. Jin, D. Klusacek, J. Abramson, R. Mihaescu, J. Godfrey, D. Jones and B. Xiang Proceedings of ICASSP-2003, Hong Kong 2003 04 __ 000001 http://www.icsi.berkeley.edu/ftp/global/pub/speech/papers/icassp03-peskin1.pdf
000226 Experiments With Linear And Nonlinear Feature Transformations In HMM Based Phone Recognition P. Somervuo Proceedings of ICASSP-2003, Hong Kong 2003 04 __ 000001 http://www.icsi.berkeley.edu/ftp/global/pub/speech/papers/icassp03-somervuo.pdf
000227 Feature Transformations and Combinations for Improving ASR Performance P. Somervuo, B. Chen and Q. Zhu Proceedings of EUROSPEECH 2003, Geneva 2003 09 __ 000001 http://www.icsi.berkeley.edu/ftp/global/pub/speech/papers/panus_eur03.pdf
000228 The Relationship Between Dialogue Acts and Hot Spots in Meetings B. Wrede and E. Shriberg Proceedings of IEEE Speech Recognition and Understanding Workshop, St. Thomas, U.S. Virgin Islands 2003 12 __ 000001 http://www.icsi.berkeley.edu/ftp/global/pub/speech/papers/asru03-hotspotsDAs.pdf
000229 Spotting B. Wrede and E. Shriberg Proceedings of EUROSPEECH 2003, Geneva 2003 09 __ 000001 http://www.icsi.berkeley.edu/ftp/global/pub/speech/papers/bwrede_eur03.pdf
000230 Multimodal Model Integration for Sentence Unit Detection L. Chen, Y. Liu, M. Harper and E. Shriberg To appear in 6th International Conference on Multimodal Interfaces, October 2004 2004 __ __ 000001
000231 Meeting Recorder Project: Dialog Act Labeling Guide R. Dhillon, S. Bhagat, H. Carvey and E. Shriberg ICSI Technical Report TR-04-002 2004 __ __ 000001 http://www.icsi.berkeley.edu/ftp/global/pub/speech/papers/MRDA-manual.pdf
000232 Using Machine Learning to Cope with Imbalanced Classes in Natural Speech: Evidence from Sentence Boundary and Disfluency Detection Y. Liu, E. Shriberg, A. Stolcke and M. Harper To appear in Proceedings of International Conference on Spoken Language Processing, Jeju, Korea, October 2004. 2004 __ __ 000001 http://www.icsi.berkeley.edu/ftp/global/pub/speech/papers/icslp2004-mde-ml.pdf
000233 From Switchboard to Meetings: Development of the 2004 ICSI-SRI-UW Meeting Recognition System N. Mirghafori, A. Stolcke, C. Wooter, T. Pirinen, I. Bulyko, D. Gelbart, M. Graciarena, S. Otterson, B. Peskin and M. Ostendorf To appear in Proceedings of International Conference on Spoken Language Processing, Jeju, Korea, October 2004. 2004 10 __ 000001 http://www.icsi.berkeley.edu/ftp/global/pub/speech/papers/icslp2004-meeting-system.pdf
000234 Selfish Behavior and Stability of the Internet: A Gamer-Theoretic Analysis of TCP A. Akella, R.M. Karp, C. Papadimitriou, S. Seshan and S. Shenker In Proceedings ACM SIGCOMM 2002 2002 __ __ 000002
000235 A Scalable System for Sharing Internet Measurements M. Allman, E. Blanton and W. Eddy Proceedings of the Passive and Active Measurement Workshop, March 2002 2002 03 __ 000002
000236 Increasing TCP's Initial Window M. Allman, S. Floyd and C. Partridge RFC 3390, October 2002. Proposed Standard. Obsoletes RFC 2414 (Experimental). 2002 10 __ 000002
000237 Design Guidelines for Robust Internet Protocols T. Anderson, S. Shenker, I. Stoica and D. Wetherall In First Workshop on Hot Topics in Networks (HotNets-I), October 2002. 2002 10 __ 000002
000238 Secure mobile agent systems using Java - where are we heading? W. Binder and V. Roth In Proceedings, 17th ACM Symposium on Applied Computing, Special Track on Agents, Interactions, Mobility, and Systems (SAC/AIMS), Madrid, Spain, March 2002. 2002 03 __ 000002
000239 On Making TCP More Robust to Packet Reordering E. Blanton and M. Allman ACM Computer Communication Review, 32(1), January 2002. 2002 01 __ 000002
000240 From Protocol Stack to Protocol Heap - Role-Based Architecture B. Braden, T. Faber and M. Handley First Workshop on Hot Topics in Networking, October 2002. 2002 10 __ 000002
000241 Towards capturing Representative AS-level Internet Topologies H. Chang, R. Govindan, S. Jamin, S. Shenker and W. Willinger SIGMETRICS 2002: 280-281. 2002 __ __ 000002
000242 The Origin of Power-Laws in Internet Topologies Revisited Q. Chen, H. Chang, R. Govindan, S. Jamin, S. Shenker and W. Willinger INFOCOM, 2002. 2002 __ __ 000002
000243 Replication Strategies in Unstructured Peer-to-Peer Networks E. Cohen and S. Shenker In Proceedings ACM SIGCOMM 2002. 2002 __ __ 000002
000244 Multiscale Stepping-Stone Detection: Detecting Pairs of Jittered Interactive Streams by Exploiting Maximum Tolerable Delay D. Donoho, A. G. Flesia, U. Shankar, V. Paxson, J. Coit and S. Staniford Proceedings of RAID, 2002. 2002 __ __ 000002
000245 A Comparison of RED's Byte and Packet Modes W. Eddy and M. Allman ACM SIGCOMM Student Poster Session, August 2002. 2002 08 __ 000002
000246 Hardness Results for Multicast Cost Sharing J. Feigenbaum, A. Krishnamurthy, R. Sami and S. Shenker Foundations of Software Technology and Theoretical Computer Science: 133-144, 2002. 2002 __ __ 000002
000247 A BGP-based Mechanism for Lowest-cost Routing J. Feigenbaum, C.H. Papadimitriou, R. Sami and S. Shenker Principles of Distributed Computing 2002: 173-182. 2002 __ __ 000002
000248 General Architectural and Policy Considerations S. Floyd, editor RFC 3426, November 2002. 2002 11 __ 000002
000249 Inappropriate TCP Resets Considered Harmful S. Floyd RFC 3360, August 2002. 2002 08 __ 000002
000250 IAB Architectural and Policy Considerations for Open Pluggable Edge Services S. Floyd and L. Daigle, editors RFC 3238, Informational, January 2002. Also an excerpt, the ISOC Member Briefing #5 on OPES. 2002 01 __ 000002
000251 Internet Research Needs Better Models S. Floyd and E. Kohler. Hotnets-I, October 2002. 2002 10 __ 000002
000252 Estimating Router ICMP Generation Delays R. Govindan and V. Paxson Proceedings of Passive & Active Measurement: PAM-2002. 2002 __ __ 000002
000254 An Analysis of The Internal Structure of Large Autonomous Systems R. Govindan and P. Radoslavov Technical Report 02-777, Computer Science Department, University of Southern California, November 2002. 2002 11 __ 000002
000255 XORP: An Open Platform for Network Research M. Handley, O. Hodson and E. Kohler First Workshop on Hot Topics in Networking, October 2002. 2002 10 __ 000002
000256 Complex Queries in DHT-based Peer-to-Peer Networks M. Harren, J.M. Hellerstein, R. Huebsch, B.T. Loo, S. Shenker and I. Stoica The 1st International Workshop on Peer-to-Peer Systems (IPTPS): 242-259, 2002. 2002 __ __ 000002
000257 Internet Congestion Control for High Bandwidth-Delay Product Environments D. Katabi, M. Handley and C. Rohrs Proceedings of ACM SIGCOMM 2002. 2002 __ __ 000002
000258 Observed Structure of Addresses in IP Traffic E. Kohler, J. Li, V. Paxson and S. Shenker Proceedings of ACM SIGCOMM Internet Measurement Workshop, November 2002. Also in Proceedings of the 2nd Internet Measurement Workshop (IMW) 2002. 2002 11 __ 000002
000259 Programming language optimizations for modular router configurations E. Kohler, R. Morris and B. Chen Proceedings of the 10th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-X), San Jose, California, October 2002, pages 251-263. 2002 10 __ 000002
000260 Modular components for network address translation E. Kohler, R. Morris and M. Poletto Proceedings of the 5th International Conference on Open Architectures and Network Programming (OPENARCH '02), New York, New York, June 2002, pages 39-50.Proceedings of the 5th International Conference on Open Architectures and Network Programming (OPENARCH '02), New York, New York, June 2002, pages 39-50. 2002 06 __ 000002
000261 Explicit Transport Error Notification (ETEN) for Error-Prone Wireless and Satellite Networks - Summary R. Krishnan, M. Allman, C. Partridge, J.P.G. Sterbenz and W. Ivancic Earth Science Technology Conference, Pasadena, CA, June 2002. 2002 06 __ 000002
000262 Explicit Transport Error Notification (ETEN) for Error-Prone Wireless and Satellite Networks R. Krishnan, M. Allman, C. Partridge and J.P.G. Sterbenz Technical Report No. 8333, BBN Technologies, March 2002. 2002 03 __ 000002
000263 Search and Replication in Unstructured Peer-to-peer Networks Q. Lv, P. Cao, E. Cohen, K. Li and S. Shenker SIGMETRICS 2002: 258-259. 2002 __ __ 000002
000264 Can Heterogeneity Make Gnutella Scalable? Q. Lv, S. Ratnasamy and S. Shenker The 1st International Workshop on Peer-to-Peer Systems (IPTPS): 94-103, 2002. 2002 __ __ 000002
000265 Controlling High Bandwidth Aggregates in the Network R. Mahajan, S. Bellovin, S. Floyd, J. Ioannidis, V. Paxson and S. Shenker Computer Communication Review 32(3), July 2002. 2002 07 __ 000002
000266 Route Flap Dampening Exacerbates Internet Routing Convergence Z.M. Mao, R. Govindan, G. Varghese and R. Katz In Proceedings of the ACM SIGCOMM 2002. 2002 __ __ 000002
000267 A Taxonomy of Traffic Matrices A. Medina, C. Fraleigh, N. Taft, S. Battacharyya and C. Diot SPIE Workshop on Scalability and Traffic Control in IP Networks II. Boston, MA. July 29-August 1, 2002. 2002 07 __ 000002
000268 Traffic Matrix Estimation Techniques: Existing Techniques Compared and New Directions A. Medina, N. Taft, K.Salamatian, S. Bhattacharyyam and C. Diot To appear on proceedings of SIGCOMM 2002, Pittsburgh, PA. August 2002. 2002 08 __ 000002
000269 Comparative Analysis of Traffic Matrix Estimation Methods A. Medina, N. Taft, K. Salamatian, S. Bhattacharyya and C. Diot DIMACS Workshop on Internet and WWW Measurement, Mapping and Modeling. February 13-15 2002. 2002 02 13 000002
000270 A Flow Table-Based Design to Approximate Fairness R. Pan, L. Breslau, B. Prabhakar and S. Shenker In Hot Interconnects: 10th Symposium on High Performance Interconnects (Hot-I) 2002. 2002 __ __ 000002
000271 The Internet Under Crisis Conditions: Learning from September 11 C. Partridge, P. Barford, D. Clark, S. Donelan, V. Paxson, J. Rexford, M. Vernon, J. Eisenberg, M. Blumenthal, D. Padgham, K. Batch, D. Drake and J. Briscoe Computer Science and Telecommunications Board, National Research Council, National Academy Press, Washington, DC, 2002. 2002 __ __ 000002
000272 A Swifter Start for TCP C. Partridge, D. Rockwell, M. Allman, R. Krishnan and J.P.G. Sterbenz Technical Report No. 8339, BBN Technologies, March 2002 2002 03 __ 000002
000273 Mobile Agent Interoperability Patterns and Practice U. Pinsdorf and V. Roth In Proceedings 9th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems, Lund, Sweden, April 2002. 2002 04 __ 000002
000274 Topologically-Aware Overlay Construction and Server Selection S. Ratnasamy, M. Handley, R.M. Karp and S. Shenker INFOCOM, 2002. 2002 __ __ 000002
000275 GHT: A Geographic Hash-table for Data-centric Storage in Sensornets S. Ratnasamy, B. Karp, L. Yin, F. Yu, D. Estrin, R. Govindan and S. Shenker In First ACM International Workshop on Wireless Sensor Networks and Applications (WSNA), September 2002. 2002 09 __ 000002
000276 Routing Algorithms for DHTs: Some Open Questions S. Ratnasamy, I. Stoica and S. Shenker The 1st International Workshop on Peer-to-Peer Systems (IPTPS): 45-52, 2002. 2002 __ __ 000002
000277 Java Security Architecture and Extensions V. Roth Dr. Dobbs Journal, 2002(335), April 2002. 2002 04 __ 000002
000278 Empowering mobile software agents V. Roth In N. Suri, editor, Proceedings 6th IEEE Mobile Agents Conference, volume 2535 of Lecture Notes in Computer Science, pages 47-63. Springer Verlag, October 2002. 2002 10 __ 000002
000279 Improved key management for digital watermark monitoring V. Roth and M. Arnold Proceedings of SPIE, San Jose, CA, January 2002. 2002 01 __ 000002
000280 Data-centric Storage in Sensornets S. Shenker, S. Ratnasamy, B. Karp, R. Govindan and D. Estrin In Workshop Record of the First Workshop on Hot Topics in Networks (HotNets-I), October 2002. 2002 10 __ 000002
000281 How to Own the Internet in Your Spare Time S. Staniford, V. Paxson and N. Weaver In Proceedings of the 11th USENIX Security Symposium, August 2002. 2002 08 __ 000002 Paper: http://www.cs.Berkeley.edu/~nweaver/cdc.web/
000282 Internet Indirection Infrastructure I. Stoica, D. Adkins, S. Ratnasamy, S. Shenker, S. Surana and S. Zhuang The 1st International Workshop on Peer-to-Peer Systems (IPTPS): 191-202, 2002. 2002 __ __ 000002
000283 Internet Indirection Infrastructure I. Stoica, D. Adkins, S. Zhuang, S. Shenker and S. Surana In Proceedings, ACM SIGCOMM, August 2002 2002 08 __ 000002
000284 Routing Algorithms in DHTs: Some Open Questions I. Stoica, D. Adkins, S. Ratnasamy, S. Surana, S. Shenker and S. Zhuang In Proceedings of the First International Workshop on Peer-to-Peer Systems (IPTPS) 2002, March 2002. 2002 03 __ 000002
000285 Self-Verifying CSFQ I. Stoica, H. Zhang and S. Shenker INFOCOM, 2002. 2002 __ __ 000002
000286 Network Topology Generators: Degree-Based vs. Structural H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker and W. Willinger In Proceedings ACM SIGCOMM 2002. 2002 __ __ 000002
000287 Scaling phenomena in the Internet: Critically examining criticality W. Willinger, R. Govindan, S. Jamin, V. Paxson and S. Shenker Proceedings of Natl. Acad. Sci. USA, Vol. 99, Suppl. 1, 2573-2580, February 19, 2002. 2002 02 19 000002
000288 Long-range dependence and data network traffic W. Willinger, V. Paxson, R.H. Riedi and M.S. Taqqu Long-range Dependence: Theory and Applications, P. Doukhan, G. Oppenheim and M. S. Taqqu, eds., Birkhauser, 2002. 2002 __ __ 000002
000289 RR-TCP: A Reordering-Bobust TCP with DSACK M. Zhang, B. Karp, S. Floyd and L. Peterson ICSI Technical Report TR-02-006, Berkeley, CA, July 2002. 2002 07 __ 000002
000290 On the Characteristics and Origins of Internet Flow Rates Y. Zhang, L. Breslau, V. Paxson and S. Shenker Proceedings of ACM SIGCOMM, August 2002. 2002 __ __ 000002
000291 Measuring End-to-End Bulk Transfer Capacity M. Allman ACM SIGCOMM Internet Measurement Workshop. November 2001. 2001 11 __ 000002
000292 Enhancing TCP's Loss Recovery Using Limited Transmit M. Allman, H. Balakrishnan and S. Floyd RFC 3042, Proposed Standard, January 2001 2001 01 __ 000002
000293 On Estimating End-to-End Network Path Properties M. Allman and V. Paxson ACM SIGCOMM Workshop on Data Communication in Latin American and the Caribbean, April 2001. This paper was originally presented at ACM SIGCOMM 1999. 2001 04 __ 000002
000294 Dynamic Behavior of Slowly-Responsive Congestion Control Algorithms D. Bansal, H. Balakrishnan, S. Floyd and S. Shenker SIGCOMM 2001 2001 __ __ 000002
000295 Dissemination of mutable sets of web objects S. Buchholz, S. Gobel, A. Schill and T. Ziegert 13th IASTED International Conference on Parallel and Distributed Computing Systems, 2001. 2001 __ __ 000002
000296 Inferring link loss using striped unicast probes N. Duffield, F. Lo Presti, V. Paxson, and D. Towsley Proceedings of IEEE INFOCOM, April 2001. 2001 04 __ 000002
000297 Approximation and collusion in multicast cost sharing J. Feigenbaum, A. Krishnamurthy, R. Sami and S. Shenker Abstratc in Proceedings of 3rd Conference on Electronic Commerce, 2001. 2001 __ __ 000002
000298 Sharing the cost of multicast transmissions J. Feigenbaum, C. Papadimitriou and S. Shenker Journal of Computer and System Sciences 63: 21-41, 2001. 2001 __ __ 000002
000299 A Report on Some Recent Developments in TCP Congestion Control S. Floyd IEEE Communications Magazine, April 2001. 2001 04 __ 000002
000300 Simulation is Crucial S. Floyd Sidebar, IEEE Spectrum, January 2001. 2001 01 __ 000002
000301 Adaptive RED: An Algorithm for Increasing the Robustness of RED's Active Queue Management S. Floyd, R. Gummadi and S. Shenker August 1, 2001. Simulation scripts. We have not yet finished the longer technical report. 2001 08 __ 000002
000302 Difficulties in Simulating the Internet S. Floyd and V. Paxson IEEE/ACM Transactions on Networking, Vol.9, No.4, pp. 392-403, August 2001. (An earlier version appeared in Proceedings of the 1997 Winter Simulation Conference, December 1997). 2001 08 __ 000002
000303 IPNL: A NAT-extended Internet architecture P. Francis and R. Gummadi SIGCOMM 2001 2001 __ __ 000002
000304 Network Intrusion Detection: Evasion, Traffic Normalization, and End-to-End Protocol Semantics (HTML) M. Handley, C. Kreibich and V. Paxson Proceedings of USENIX Security Symposium 2001. 2001 __ __ 000002
000305 A Comparison of Incremental Deployment Strategies for Router-Assisted Reliable Multicast X. He, C. Papadopoulos, P. Radoslavov and R. Govindan Technical Report 01-751, Computer Science Department, University of Southern California, July 2001. 2001 07 __ 000002
000306 Building efficient wireless sensor networks with low-level naming J. Heidemann, F. Silva, C. Intanagonwiwat, R. Govindan, D. Estrin and D. Ganesan Proceedings of the Symposium on Operating Systems Principles, Banff, Canada, October 2001. 2001 10 __ 000002
000307 J. Ishac and M. Allman On the Performance of TCP Spoofing in Satellite Networks IEEE Milcom. October 2001. 2001 10 __ 000002
000308 Experimentation and Modeling of HTTP Over Satellite Channels H. Kruse, M. Allman, J. Griner and D. Tran International Journal of Satellite Communications, 19(1), January/February 2001. 2001 01 __ 000002
000309 Controlling High-Bandwidth Flows at the Congested Router R. Mahajan and S. Floyd ICSI Tech Report TR-01-001, April 2001. (A revised version appeared in ICNP 2001.) 2001 04 __ 000002
000310 Controlling high-bandwidth flows at the congested router R. Mahajan, S. Floyd and D. Wetherall ICNP 2001 2001 __ __ 000002
000311 A Framework for Defining Empirical Bulk Transfer Capacity Metrics M. Mathis and M. Allman RFC 3148. July 2001. 2001 07 __ 000002
000312 BRITE: An Approach to Universal Topology Generation A. Medina, A. Lakhina, I. Matta and J. Byers In Proceedings of MASCOTS 2001. IEEE Computer Society, August 2001. 2001 08 __ 000002
000313 BRITE: Universal Topology Generation from a User's Perspective A. Medina, A. Lakhina, I. Matta and J. Byers BU-CS-TR-2001-003. April 05, 2001. 2001 04 05 000002
000314 Identifying the TCP Behavior of Web Servers J. Padhye and S. Floyd SIGCOMM 2001, August 2001. Or the ICSI Technical Report 01-002, February 2001. 2001 __ __ 000002
000315 An Analysis of Using Reflectors for Distributed Denial-of-Service Attacks V. Paxson Computer Communication Review 31(3), July 2001. 2001 07 __ 000002
000316 The Relationship Between Topology and Protocol Performance: Case Studies P. Radoslavov PhD Dissertation, Computer Science Department, University of Southern California, December 2001. 2001 12 __ 000002
000317 Topology-Informed Internet Replica Placement P. Radoslavov, R. Govindan and D. Estrin Proceedings of the Sixth International Workshop on Web Caching and Content Distribution, Boston University, Boston, Massachusetts, USA, June 20-22, 2001. 2001 06 20 000002
000318 A Comparison of Application-Level and Router-Assisted Hierarchical Schemes for Reliable Multicast P. Radoslavov, C. Papadopoulos, R. Govindan and D. Estrin Proceedings of the IEEE Infocom 2001, Anchorage, Alaska, USA, April 22-26, 2001. 2001 04 22 000002
000319 The Addition of Explicit Congestion Notification (ECN) to IP K.K. Ramakrishnan, S. Floyd and D. Black RFC 3168, Proposed Standard, September 2001. 2001 09 __ 000002
000320 A Scalable Content-Addressable Network S. Ratnasamy, P. Francis, M. Handley, R.M. Karp and S. Shenker In proceedings of ACM SIGCOMM 2001 2001 __ __ 000002
000321 S. Ratnasamy, M. Handley, R.M. Karp and S. Shenker Application-level Multicast using Content-Addressable Networks In Proceedings of 3rd International Workshop on Networked Group Communication, London, Nov 2001. 2001 11 __ 000002
000322 Adaptive power control for ad-hoc networks M. Sanchez 5th International Conference on Sytemics Cybernetics and Informatics, SCI 2001. 2001 __ __ 000002
000323 Petri net based performance evaluation of USAIA's bandwidth partitioning for the wireless cell level J. Sokol and D. Tutsch PNPN Petri nets and Performance Models, September 2001. 2001 09 __ 000002
000324 Does AS size determine degree in AS topology? H. Tangmunarunkit, J. Doyle, R. Govindan, S. Jamin, S. Shenker and W. Willinger ACM Computer Communication Review, October 2001. 2001 10 __ 000002
000325 Internet pat inflation due to policy routing H. Tangmunarunkit, R. Govindan and S. Shenker In Proceedings of SPIE ITCom 2001, Denver, CO. 19-24. August 2001. 2001 08 __ 000002
000326 The Impact of Routing Policy on Internet Paths H. Tangmunarunkit, R. Govindan, S. Shenker and D. Estrin INFOCOM 2001: 736-742. 2001 __ __ 000002
000327 Reliable Multicast Transport Building Blocks for One-to-Many Bulk-Data Transfer B. Whetten, L. Vicisano, R. Kermode, M. Handley, S. Floyd and M. Luby RFC 3048, Informational, January 2001. 2001 01 __ 000002
000328 Extending Equation-Based Congestion Control to Multicast Applications J. Widmer and M. Handley Proceedings of ACM SIGCOMM 2001. 2001 __ __ 000002
000329 On the Constancy of Internet Path Properties Y. Zhang, N. Duffield, V. Paxson and S. Shenker Proceedings of ACM SIGCOMM Internet Measurement Workshop, November 2001. 2001 11 __ 000002
000330 The Use of End-to-end Multicast Measurements for Characterizing Internal Network Behavior A. Adams, T. Bu, R. Caceres, N. Duffield, T. Friedman, J. Horowitz, F. Lo Presti, S.B. Moon, V. Paxson and D. Towsley IEEE Communications, 38(5), May 2000. 2000 04 __ 000002
000331 Parallel Sorting with Limited Bandwidth M. Adler, J. Byers and R.M. Karp SIAM Journal of Computing 29(6): 1997-2015, 2000. 2000 __ __ 000002
000332 A Web Server's View of the Transport Layer M. Allman ACM Computer Communication Review, 30(5), October 2000. 2000 10 __ 000002
000333 Ongoing TCP Research Related to Satellites M. Allman, S. Dawkins, D. Glover, J. Griner, D. Tran, T. Henderson, J. Heidemann, J. Touch, H. Kruse, S. Ostermann, K. Scott and J. Semke February 2000. RFC 2760. 2000 02 __ 000002
000334 TCP Behavior in Networks with Dynamic Propagation Delay M. Allman, J. Griner and A. Richard Proceedings of Globecom 2000, November 2000. 2000 11 __ 000002
000335 A History of the Improvement of Internet Protocols Over Satellites Using ACTS M. Allman, H. Kruse and S. Ostermann Invited paper for ACTS Conference 2000, May 2000. 2000 05 __ 000002
000336 FTP Extensions for Variable Protocol Specification M. Allman and S. Ostermann Technical Report CR-209414, NASA Glenn Research Center, February 2000. 2000 02 __ 000002
000337 Universal DNA Tag Systems: A Combinatorial Design Scheme A. Ben-Dor, R.M. Karp, B. Schwikowski and Z. Yakhini RECOMB, 2000. 2000 __ __ 000002
000338 IANA Allocation Guidelines For Values In the Internet Protocol and Related Headers S. Bradner and V. Paxson RFC 2780, Best Current Practice, March 2000. 2000 03 __ 000002
000339 Advances in Network Simulation L. Breslau, et al. IEEE Computer, May 2000, pp. 59-67. Or the technical report: Technical Report 99-702, University of Southern California, March 1999. 2000 05 __ 000002
000340 Comments on the Performance of Measurement-Based Admission Control Algorithms L. Breslau, S. Jamin and S. Shenker INFOCOM 2000, Tel Aviv, Israel, March 2000. 2000 03 __ 000002
000341 Endpoint Admission Control: Architectural Issues and Performance L. Breslau, E.W. Knightly, S. Shenker, I. Stoica and H. Zhang ACM SIGCOMM 2000, pages 57-69, Stockholm, Sweeden, October 2000. 2000 10 __ 000002
000342 An Optimal Algorithm for Monte-Carlo Estimation P. Dagum, R.M. Karp, M. Luby and S. Ross SIAM Journal of Computing, 29(5):1484-1496, 2000. 2000 __ __ 000002
000343 Advantages of Parallel Processing and the Effects of Communications Time W. Eddy and M. Allman Technical Report CR-209455, NASA Glenn Research Center, February 2000. 2000 02 __ 000002
000344 Network Visualization with the Nam, VINT Network Animator D. Estrin, M. Handley, J. Heidemann, S. McCanne, Y. Xu and H. Yu IEEE Computer, 33(11), 63-68, November 2000. 2000 11 __ 000002
000345 Sharing the Cost of Multicast Transmissions J. Feigenbaum, C. Papadimitriou and S. Shenker Thirty-Second Annual ACM Symposium on Theory of Computing (STOC00), May 2000. 2000 05 __ 000002
000346 Congestion Control Principles S. Floyd RFC 2914, Best Current Practice, September 2000. 2000 09 __ 000002
000347 Equation-Based Congestion Control for Unicast Applications S. Floyd, M. Handley, J. Padhye and J. Widmer In Proceeding of ACM SIGCOMM 2000. 2000 __ __ 000002
000348 An Extension to the Selective Acknowledgement (SACK) Option for TCP S. Floyd, J. Mahdavi, M. Mathis and M. Podolsky RFC 2883, Proposed Standard, July 2000. 2000 07 __ 000002
000349 TCP Congestion Window Validation M. Handley, S. Floyd and J. Padhye RFC 2861, Experimental, June 2000. 2000 06 __ 000002
000350 The Reliable Multicast Design Space for Bulk Data Transfer M. Handley, S, Floyd, B. Whetten, R. Kermode, L. Vicisano and M. Luby RFC 2887, Informational, August 2000. 2000 08 __ 000002
000351 TCP Congestion Window Validation M. Handley, J. Padhye and S. Floyd RFC 2861, Experimental, June 2000. Or the technical report: UMass CMPSCI Technical Report 99-77, September 1999. 2000 06 __ 000002
000352 Session Announcement Protocol M. Handley, C. Perkins, E. Whelan RFC 2974, Experimental, October 2000. 2002 10 __ 000002
000353 Multicast-Scope Zone Announcement Protocol (MZAP) M. Handley, D. Thaler and R. Kermode RFC 2776, Proposed Standard, February 2000. 2000 02 __ 000002
000354 Discovery of Rgulatory Interactions Through Perturbation: Inference and Experimental Design T.E. Ideker, V. Thorsson and R.M. Karp Pacific Symp. Biocomputing, 2000. 2000 __ __ 000002
000355 GPSR: Greedy Perimeter Stateless Routing for Wireless networks B. Karp and H.T. Kung MOBICOM, 2000. 2001 __ __ 000002
000356 Optimization Problems in Congestion Control R.M. Karp, E. Koutsoupias, C.H. Papadimitriou and S. Shenker FOCS 2000: 66-74. 2000 __ __ 000002
000357 Randomized Rumor Spreading R.M. Karp, C. Schindelhauer, S. Shenker and B. Vocking FOCS 2000, 565-574. 2000 __ __ 000002
000358 Algorithms for Optical Mapping R.M. Karp and R. Shamir Journal of Computational Biology 7(1,2) 2000. 2000 __ __ 000002
000359 The Click modular router E. Kohler Ph.D. thesis, Massachusetts Institute of Technology, November 2000. 2000 11 __ 000002
000360 Programming language techniques for modular router configurations E. Kohler, B. Chen, M.F. Kaashoek, R. Morris and M. Poletto MIT Laboratory for Computer Science technical report MIT-LCS-TR-812, August 2000. 2000 08 __ 000002
000361 The Click modular router E. Kohler, R. Morris, B. Chen, J. Jannotti and M.F. Kaashoek ACM Transactions on Computer Systems 18 (3), August 2000, pages 263-297. 2000 08 __ 000002
000362 On the Performance of TCP-based Data Transfers on a Faded Ka-Band Satellite Link H. Kruse, S. Ostermann and M. Allman . Proceedings of the 6th Ka-Band Utilization Conference, June 2000. 2000 06 __ 000002
000363 On the Origin of Power Laws in Internet Topologies A. Medina, I. Matta and J. Byers ACM Computer Communications Review, April 2000. Also BU-CS-TR-2000-004. January 21, 2000. 2000 04 __ 000002
000364 BRITE: A Flexible Generator of Internet Topologies A. Medina and I. Matta BU-CS-TR-2000-005. January 21, 2000. 2000 01 21 000002
000365 Experiences with NIMI V. Paxson, A. Adams and M. Mathis Proceedings of Passive & Active Measurement: PAM-2000. 2000 __ __ 000002
000366 Computing TCP's Retransmission Timer V. Paxson and M. Allman RFC 2988, Proposed Standard, November 2000. 2000 11 __ 000002
000367 The Multicast Address-Set Claim (MASC) Protocol P. Radoslavov, D. Estrin, R. Govindan, M. Handley, S. Kumar and D. Thaler RFC 2909, Experimental, September 2000. 2000 09 __ 000002
000368 On Characterizing Network Topologies and Analyzing Their Impact on Protocol Design P. Radoslavov, H. Tangmunarunkit, H. Yu, R. Govindan, S. Shenker and D. Estrin Technical Report 00-731, Computer Science Department, University of Southern California, February 2000. 2000 02 __ 000002
000369 Multimedia Proxy Caching for Quality Adaptive Streaming Applications in the Internet R. Rejaie, H. Yu, M. Handley and D. Estrin In Proceedings of Infocom 2000. 2000 __ __ 000002
000370 Stream Control Transmission Protocol R. Stewart, Q. Xie, K. Morneault, C. Sharp, H. Schwarzbauer, T. Taylor, I. Rytina, M. Kalla, L. Zhang and V. Paxson RFC 2960, Proposed Standard, October 2000. 2000 10 __ 000002
000371 On the Aggregatability of Multicast Forwarding State D. Thaler and M. Handley In Proceedings of Infocom 2000. 2000 __ __ 000002
000372 The Internet Multicast Address Allocation Architecture D. Thaler, M. Handley and D. Estrin RFC 2908, Informational, September 2000. 2000 09 __ 000002
000373 A Comparison of the AES Candidates Amenability to FPGA Implementation N. Weaver and J. Wawrzynek The Third Advanced Encryption Standard (AES) Candidate Conference, 2000. 2000 __ __ 000002
000374 Reliable Multicast Transport Building Blocks for One-to-Many Bulk-Data Transfer B Whetton, L. Vicisano, R. Kermode, M. Handley, S. Floyd and M. Luby Experimental RFC, October 2000. 2000 10 __ 000002
000375 TCP Processing of the IPv4 Precedence Field X. Xiao, A. Hannan, V. Paxson and E. Crabbe RFC 2873, Proposed Standard, June 2000. 2000 06 __ 000002
000376 Ms.Detecting Backdoors Y. Zhang and V. Paxson In Proceedings of the 9th USENIX Security Symposium, August 2000. 2000 08 __ 000002
000377 Detecting Stepping Stones Y. Zhang and V. Paxson In Proceedings of the 9th USENIX Security Symposium, August 2000. 2000 08 __ 000002
000378 The Stationarity of Internet Path Properties: Routing, Loss, and Throughput Y. Zhang, V. Paxson and S. Shenker ACIRI Technical Report, May 2000. 2000 05 __ 000002
000379 TCP Byte Counting Refinements M. Allman ACM Computer Communication Review, 29(3), July 1999. 1999 07 __ 000002
000380 On the Effective Evaluation of TCP M. Allman and A. Falk ACM Computer Communication Review, 29(5), October 1999. 1999 10 __ 000002
000381 Enhancing TCP Over Satellite Channels using Standard Mechanisms. M. Allman, D. Glover and L. Sanchez RFC 2488, BCP 28, January 1999. 1999 01 __ 000002
000382 FTP Security Considerations M. Allman and S. Ostermann RFC 2577, May 1999. 1999 05 __ 000002
000383 On Estimating End-to-End Network Path Properties M. Allman and V. Paxson ACM SIGCOMM, September 1999, Cambridge, MA. 1999 09 __ 000002
000384 TCP Congestion Control M. Allman, V. Paxson and W.R. Stevens RFC 2581, Proposed Standard, April 1999. 1999 04 __ 000002
000385 Web Caching and Zipf-like Distributions: Evidence and Implications L. Breslau, P. Cao, L. Fan, G. Phillips and S. Shenker In Proceedings of Infocom 1999. 1999 __ __ 000002
000386 Internetworking Multimedia J. Crowcroft, M. Handley and I. Wakeman Morgan Kaufmann, ISBN 1-55860-584-3, 1999. 1999 __ __ 000002
000387 A Dynamic Bootstrap Mechanism for Rendezvous-based Multicast Routing D. Estrin, M. Handley, A. Helmy, P. Huang and D. Thaler In Proceedings of Infocom 1999. 1999 __ __ 000002
000388 Promoting the Use of End-to-End Congestion Control in the Internet S. Floyd and K. Fall IEEE/ACM Transactions on Networking, August 1999. Winner of the Communications Society William R. Bennett Prize Paper Award, 1999. 1999 08 __ 000002
000389 The NewReno Modification to TCP's Fast Recovery Algorithm S. Floyd and T. Henderson RFC 2582, Experimental, April 1999. 1999 04 __ 000002
000390 An architecture for a global Internet host distance estimation service P. Francis, S. Jamin, V. Paxson, L. Zhang, D. Gryniewicz and Y. Jin In Proceedings of IEEE INFOCOM, March 1999. 1999 03 __ 000002
000391 A readable TCP in the Prolac protocol language E. Kohler, M.F. Kaashoek and D.R. Montgomery In Proceedings of the ACM SIGCOMM '99 Conference: Applications, Technologies, Architectures, and Protocols for Computer Communication, Cambridge, Massachusetts, August 1999, pages 3-13. 1999 08 __ 000002
000392 Evolving software with an application-specific language E. Kohler, M, Poletto and D.R. Montgomery Workshop Record of WCSSS '99: The 2nd ACM SIGPLAN Workshop on Compiler Support for Systems Software, Atlanta, Georgia, May 1999, pages 94-102. 1999 05 __ 000002
000393 Satellite Network Performance Measurements Using Simulated Multi-User Internet Traffic H. Kruse, M. Allman, J. Griner, S. Ostermann and E. Helvey In Proceedings of the Seventh International Conference on Telecommunication Systems. March 1999. 1999 03 __ 000002
000394 IPPM Metrics for Measuring Connectivity J. Mahdavi and V. Paxson RFC 2678, Proposed Standard, September 1999. 1999 09 __ 000002
000395 The Click modular router R. Morris, E. Kohler, J. Jannotti and M.F. Kaashoek In Proceedings of the 17th ACM Symposium on Operating Systems Principles (SOSP '99) , Kiawah Island, South Carolina, December 1999, pages 217-231. 1999 12 __ 000002
000396 Bro: A System for Detecting Network Intruders in Real-Time V. Paxson Computer Networks, 31(23-24), pp. 2435-2463, 14 Dec. 1999. 1999 12 14 000002
000397 End-to-End Internet Packet Dynamics V. Paxson IEEE/ACM Transactions on Networking, Vol.7, No.3, pp. 277-292, June 1999. An earlier version appeared in Proc. ACM SIGCOMM '97, September 1997, Cannes, France. 1999 06 __ 000002
000398 Known TCP Implementation Problems V. Paxson, M. Allman, S. Dawson, W. Fenner, J. Griner, I. Heavens, K. Lahey, J. Semke and B. Volz RFC 2525, Informational, March 1999. 1999 03 __ 000002
000399 Scaling of Multicast Trees: Comments on the Chuang-Sirbu Scaling Law G. Phillips, S. Shenker and H. Tangmunarunkit SIGCOMM, September 1999. 1999 09 __ 000002
000400 Exploiting the Bandwidth-Memory Tradeoff in Multicast State Aggregation P. Radoslavov, D. Estrin and R. Govindan Technical Report 99-697, Computer Science Department, University of Southern California, July 1999. 1999 07 __ 000002
000401 A Proposal to add Explicit Congestion Notification (ECN) to IP K.K. Ramakrishnan and S. Floyd RFC 2481, Experimental, January 1999. Obsoleted by RFC 3168, Proposed Standard. 1999 01 __ 000002
000402 Quality Adaptation for Congestion Controlled Playback Video over the Internet R. Rejaie, M. Handley and D. Estrin In Proceedings of ACM SIGCOMM '99, Cambridge, September 1999. 1999 09 __ 000002
000403 RAP: An End-to-end Rate-based Congestion Control Mechanism for Realtime Streams in the Internet. R. Rejaie, M. Handley and D. Estrin In Proceedings of Infocom 1999. 1999 __ __ 000002
000404 Proxy Caching Mechanism for Multimedia Playback Streams in the Internet R. Rejaie, M. Handley, H. Yu and D. Estrin In Proc. 4th International Web Caching Workshop, San Diego, California, March 31 - April 2, 1999. 1999 03 __ 000002
000405 A Scalable Web Cache Consistency Architecture H. Yu, L. Breslau and S. Shenker In Proceedings of ACM SIGCOMM'99, Cambridge, Sept. 1999. 1999 09 __ 000002
000406 Selfish behavior and stability of the Internet: a game-theoretic analysis of TCP A. Akella, R.M. Karp, S. Seshan, S. Shenker and C. Papadimitriou. In Proceedings ACM SIGCOMM 2002. 2002 __ __ 000003
000407 Multiple sequence alighment with arbitrary gap costs: computing an optimal solution using polydhedral combinatorics E. Althaus, A. Caprara, H.P. Lenhof and K. Reinert In ECCB, 4-16, 2002. 2002 __ __ 000003
000408 A polyhedral approach to surface reconstruction from planar contours E. Althaus and C. Fink In Proceedings of the Ninth Conference on Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, 2002. 2002 __ __ 000003
000409 Constant-factor approximation of vertex-cuts in planar graphs E. Amir, R. Krathgamer and S. Rao Manuscript, 2002. 2002 __ __ 000003
000410 The efficiency of resolution and Davis-Putnamn procedures P. Beame, R.M. Karp, T. Pitassi and M. Saks In SIAM Journal of Computing 31(4) 1048-1075, 2002. 2002 __ __ 000003
000411 Discovering local structure in gene expression data: the order preserving submatrix problem A. Ben-Dor, B. Chor, R.M. Karp and Z. Yakhini In Proceedings of the Sixth Annual International Conference on Research in Computational Molecular Biology (RECOMB'02), 2002. 2002 __ __ 000003
000412 The restriction scaffold problem A. Ben-Dor, R.M. Karp, B Schwikowski and R. Shamir In Proceedings of the Sixth Annual International Conference on Research in Computational Molecular Biology (RECOMB'02), 2002. 2002 __ __ 000003
000413 Idempotents among Partesan Games E. Berlekamp In More Games of No Chance, MSRI Publicatons vol. 42, pp 3-23, Cambridge University Press, 2002. 2002 __ __ 000003
000414 Large-scale reconstruction of haplotype structure via perfect phylogeny E. Eskin, E. Halperin and R.M. Karp Technical report UCB/CSD 2-1196, August 2002. 2002 08 __ 000003
000415 Large-scale recovery of haplotypes from genotype data using imperfect phylogeny E. Halperin and E. Eskin Technical report no. UCB/CSD-1-1196, August 2002. 2002 08 __ 000003
000416 Improved approximation algorithms for the partial vertex cover problem E. Halperin and R. Srinivasan In 5th International Workshop on Approximation Algorithms for Combinatorial Optimization, (APPROX), 185-199, Springer, 2002. 2002 __ __ 000003
000417 Mathematical challenges from genomics and molecular biology R.M. Karp In Notices of the American Mathematical Society, 49(5) 544-553, 2002. 2002 __ __ 000003
000418 Hardness of approximation for vertex-connectivity network design problems G. Kortsarz, R. Krauthgamer and J.R. Lee In 5th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX), 185-199, Springer, 2002. 2002 __ __ 000003
000419 The intrinsic dimensionality of graphs R. Krauthgamer and J.R. Lee Manuscript, 2002. 2002 __ __ 000003
000420 Online scheduling for sorting buffers H. Racke, C. Sohler and M. Westermann European Symposium on Algorithms, 820-832, 2002. 2002 __ __ 000003
000421 Go Thermography: The 4/12/98 Jiang-Rui Environmental Endgame B. Spight More Games of No Chance, MSRI Publictations vo. 42, Cambridge University Press, 2002. 2002 __ __ 000003
000422 Distributed caching independent of the network size M. Westermann Symposium on Parallel Algorithms and Archiectures, 31-40, 2002. 2002 __ __ 000003
000423 Distance metric learning, with application to clustering with side-information E.P. Xing, A.Y. Ng, M.I. Jordan and S. Russell To appear in Neural Information Processing Systems, 2002. 2002 __ __ 000003
000424 A hierarchical Bayesian Markovian model for motifs in biopolymer sequences E.P. Xing, M.I. Jordan, R.M. Karp and S. Russell To appear in Neural Information Processing Systems, 2002. 2002 __ __ 000003
000425 Curve reconstruction and the traveling salsman problem. E. Althaus Ph.D. Thesis, Universitat des Saarlandes. 2001. 2001 __ __ 000003
000426 TSP-based curve reconstruction in polynomial time E. Althaus and K. Melhorn SIAM Journal of Computing 31(1), 2001. 2001 __ __ 000003
000427 Developments in Forecast Combination and Portfolio Choice C. Dunis, A. Timmermann and J. Moody, eds Wiley Financial Economics, London, 2001. 2001 __ __ 000003
000428 A Maximun Likelihood Polynomial Time Syndrome Decoder to Correct Linearly Independent Errors G.B. Horn and R.M. Karp In Proceedings of International Symp. on Information Theory, 2001. 2001 __ __ 000003
000429 Approximation algorithms for data management in networks C. Krick, H. Racke and M. Westermann In Proceedings of the 13th ACM Symposium on Parallel Algorithms and Architectures (SPAA) pp. 237-246, 2001. 2001 __ __ 000003
000430 Approximation algorithms for data management in networks C. Krick, H. Racke and M. Westermann Theory of Computing Systems, 2001. 2001 __ __ 000003
000431 Neural Networks for Time Series Analysis Y Liao, J. Moody and L. Wu In Handbook on Neural Network Signal Processing, edited by Y-H Hu and J-N Hwang, CRC Press 2001. 2002 __ __ 000003
000432 Learning to Trade via Direct Reinforcement J. Moody and M. Saffell IEEE Transactions on Neural Networks, Vol. 12, No. 4, July 2001. 2001 07 __ 000003
000433 On approximating optimal auctions A. Ronen In The Third ACM Conference on Electronic Commerce (EC01), 11-17, 2001. 2001 __ __ 000003
000434 TSP-based curve reconstruction in polynomial time E. Althaus and K. Melhorn In Proceedings of the 11th Symp. Discrete Algorithms, pp. 686-695, 2000. 2000 __ __ 000003
000435 Experiments on curve reconstruction E. Althaus, K. Melhorn. S Naher and S. Schirra In Proceedings of the 2nd Workshop Algorithm Engineering and Experiments (ALENEX00). Lecture Notes in Computer Science, Springer-Verlag, 2000. 2000 __ __ 000003
000436 A branch and cut algorithm for the optimal solution of the side chain placement problem E. Althaus, O. Kohlbacher, H.P. Lenhof and P. Muller Tech report Vol.2000-1-001, Max-Planck-Institut fur Informatik: Foschungsbericht, 2000. 2000 __ __ 000003
000437 A combinatorial approach to protein docking wit flexible side-chains E. Althaus, O. Kohlbacher, H.P. Lenhof and P. Muller In Proceedings of the 4th Annual International conference on Computational Molecular Biology (RECOMB-00), Tokyo, Japan, 2000. 2000 __ __ 000003
000438 Universal DNA Tag Systems: A Combinatorial Design Scheme A. Ben-Dor, R. Karp, B. Schwikowski and Z. Yakhini Proceedings of RECOMB 2000. 2000 __ __ 000003
000439 An optimal algorithm for Monte Carlo estimation P. Dagum, R.M. Karp, M. Luby and S. Ross SIAM Journal on Computing, SIAM J. Comput. (USA), vol.29, (no.5), SIAM, 2000. p.1484-96. 2000 __ __ 000003
000440 Topologically-aware overlay construction and server selection M. Handley, R.M. Karp, S. Ratnasamy and S. Shenker In Proceedings, INFOCOM 2000. 2000 __ __ 000003
000441 Discovery of Regulatory Interactions Through Perturbation: Inference and Experimental Design T.E. Ideker, V. Thorsson and R.M. Karp Proceedings of Pacific Symposium on Biocomputing (2000). 2000 __ __ 000003
000442 Constructing Heterogeneous Committees via Input Feature Grouping Y. Liao and J. Moody In Advances in Neural Information Processing Systems, Vol.12, S.A. Solla, T.K. Leen and K.-R. Muller (eds.),MIT Press, 2000. 2000 __ __ 000003
000443 Minimizing Downside Risk via Stochastic Dynamic Programming J. Moody and M. Saffell In Computational Finance 1999, edited by Y. S. Abu-Mostafa, B. LeBaron, A. W. Lo, and A. S. Weigend, MIT Press, Cambridge, MA, 2000. 2000 __ __ 000003
000444 Term Structure of Interactions of Foreign Exchange Rates J. Moody and H. Yang In Computational Finance 1999, edited by Y. S. Abu-Mostafa, B. LeBaron, A. W. Lo, and A. S. Weigend, MIT Press, Cambridge, MA, 2000. 2000 __ __ 000003
000445 Discrete Prediction games with Arbitrary Feedback and Loss A. Piccolboni and C. Schindelhauer Technical Report AIIM-TR-A-00-18, Universitat zu Lubeck, Novermber 2000. 2000 11 __ 000003
000446 Data Visualization and Feature Selection: New Algorithms for Nongaussian Data H. Yang and J. Moody In Advances in Neural Information Processing Systems, Vol.12, S.A. Solla, T.K. Leen and K.R. Muller (eds.), MIT Press, 2000. 2000 __ __ 000003
000447 Challenges for theory of computing A. Condon, H. Edelsbrunner, E.A. Emerson, L. Fortnow, et.al. SIGACT News, June 1999, vol.30, (no.2):62-76. 1999 06 __ 000003
000448 Algorithms for graph partitioning on the planted partition model. (Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques. A. Condon and R.M. Karp Edited by: Hochbaum, D., Jansen, K., Rolim, J.D.P., Sinclair, A. Berlin, Germany: Sprnger-Verlag, 1999. p.221-32. ix+287 pp. 14 1999 __ __ 000003
000449 Error-resilient DNA computation. Random Structures & Algorithms, Random Struct R.M. Karp, C. Kenyon and O. Waarts Algorithms (USA), vol.15, (no.3-4), Wiley, Oct.-Dec. 1999. p.450-66. 19 1999 10 __ 000003
000450 Reinforcement Learning for Trading, Advances in Neural Information Processing Systems 11 M.S. Kearns, S.A. Solla and D.A. Cohn, eds. MIT Press, Cambridge, MA 1999. 1999 __ __ 000003
000451 Predicting Blood Glucose Metabolism in Diabetics -- A Machine Learning Solution V. Tresp, T. Briegel and J. Moody IEEE Transactions on Neural Networks, v. 10, n. 5, pp. 1204--1213, 1999. 1999 __ __ 000003
000452 Feature Selection Based on Joint Mutual Information H. Yang and J. Moody In Advances in Intelligent Data Analysis (AIDA), Computational Intelligence Methods and Applications (CIMA), International Computer Science Conventions, Rochester, New York, June 22-25, 1999. 1999 06 __ 000003
000453 On the complexity of unsatisfiability proofs for random k-CNF formulas P. Beame, R.M. Karp, T. Pitassi and M. Saks Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing. May 1998. New York, NY, USA: ACM, 1998. p. 561-71. 1998 05 __ 000003
000454 Branch and infer: A unifying framework for integer and nite domain constraint programming A. Bockmayr and T. Kasper INFORMS Journal on Computing, 10(3): 287-300, 1998. 1998 __ __ 000003
000455 Constructing maps using the span and inclusion relations D. Fasulo, T. Jiang, R.M. Karp and N. Sharma RECOMB 98. Proceedings of the Second Annual International Conference on Computational Molecular Biology. March 1998. Edited by: Istrail, S.; Pevzner, P.; Waterman, M. New York, NY, USA: ACM, 1998. p. 64-73. 1998 __ __ 000003
000456 Graph traversals, genes and matroids: an efficient case of the travelling salesman problem. D. Gusfield, R.M. Karp, L. Wang and P. Stelling Discrete Applied Mathematics, 9 Nov. 1998, vol.88, (no.1-3):167-80. 1998 __ __ 000003
000457 Mapping clones with a given ordering or interleaving T. Jiang and R.M. Karp Algorithmica, July 1998, vol.21, (no.3):262-84. 1998 __ __ 000003
000458 Variations on the theme of "twenty questions" R.M. Karp Proceedings. 1998 IEEE International Symposium on Information Theory, Aug. 1998. New York, NY, USA: IEEE, 1998. p. 3. 1998 08 __ 000003
000459 Algorithms for optical mapping R.M. Karp and R. Shamir RECOMB 98. Proceedings of the Second Annual International Conference on Computational Molecular Biology. 22-25 March 1998. Edited by: Istrail, S.; Pevzner, P.; Waterman, M. New York, NY, USA: ACM, 1998. p. 117-24. 1998 __ __ 000003
000460 On parallel evaluation of game trees R.M. Karp and Y. Zhang Journal of the ACM, Nov. 1998, vol.45, (no.6):1050-75. 1998 __ __ 000003
000461 Forecasting the Economy with Neural Nets: A Survey of Challenges and Solutions J. Moody In Neural Networks: Tricks of the Trade, Genevieve B. Orr and Klaus-Robert Muller, eds., Springer Verlag, pp. 347-371, 1998. 1998 __ __ 000003
000462 Reinforcement Learning for Trading: Immediate vs. Future Rewards J. Moody and M. Saffell Knowledge Discovery and Datamining, Proceedings of the 1998 New York Conference, AAAI Press, 1998. 1998 __ __ 000003
000463 Reinforcement Learning for Trading Systems and Portfolios J. Moody, M. Saffell, Y. Liao and L. Wu Decision Technologies for Computational Finance, Proceedings of the London Conference, A.N. Refenes, N. Burgess and J. Moody, eds., Kluwer Financial Publishing, 1998. 1998 __ __ 000003
000464 Performance Functions and Reinforcement Learning for Trading Systems and Portfolios J. Moody, L. Wu, Y. Liao and M. Saffell Journal of Forecasting, vol. 17, pp. 441-470, 1998. 1998 __ __ 000003
000465 High Frequency Foreign Exchange Rates: Price Behavior Analysis and `True Price' Models J. Moody and L. Wu Chapter 2 of Nonlinear Modelling of High Frequency Financial Data, Christian Dunis and Bin Zhou, editors, Wiley Financial Publishing, London, 1998. 1998 __ __ 000003
000466 Decision Technologies for Computational Finance, Proceedings of the London Conference A. Refenes, N. Burgess, and J. Moody, eds. Kluwer Financial Publishing, The Netherlands, 1998. 1998 __ __ 000003
000467 Emerging opportunities for theoretical computer science A.V. Aho, D.S. Johnson, R.M. Karp, S.R. Kosaraju, and others SIGACT News, Sept. 1997, vol.28, (no.3):65-74. 1997 __ __ 000003
000468 The rank of sparse random matrices over finite fields J. Blomer, R.M. Karp and E. Welzl Random Structures & Algorithms, July 1997, vol.10, (no.4):407-19. 1997 07 __ 000003
000469 Nearly optimal competitive online replacement policies R. El-Yaniv and R.M. Karp Mathematics of Operations Research, Nov. 1997, vol.22, (no.4):814-39. 1997 __ __ 000003
000470 Mapping clones with a given ordering or interleaving T. Jiang and R.M. Karp Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. Jan. 1997. New York, NY, USA: ACM, 1997. p. 400-9. 1997 01 __ 000003
000471 Stochastic Manhattan Learning: Time-Evolution Operator for the Ensemble Dynamics T. Leen and J. Moody Physical Review E, 1997. 1997 __ __ 000003
000472 Smoothing Regularizers for Projective Basis Function Networks J. Moody and T. Rognvaldsson In Advances in Neural Information Processing Systems 9, M.C. Mozer, M.I. Jordan and T. Petsche, eds, MIT Press, Cambridge, 1997. 1997 __ __ 000003
000473 Optimization of Trading Systems and Portfolios J. Moody and L. Wu In Decision Technologies for Financial Engineering, Y. Abu-Mostafa, A. N. Refenes, and A. S. Weigend, eds., World Scientific, London, 1997. 1997 __ __ 000003
000474 What is the True Price? -- State Space Models for High Frequency FX Rates J. Moody and L. Wu In Decision Technologies for Financial Engineering, Y. Abu-Mostafa, A. N. Refenes, and A. S. Weigend, eds., World Scientific, London, 1997. 1997 __ __ 000003
000475 Multi-Effect Decompositions for Financial Data Modeling L. Wu and J. Moody in Advances in Neural Information Processing Systems 9, M.C. Mozer, M.I. Jordan and T. Petsche, eds, MIT Press, Cambridge, 1997. 1997 __ __ 000003
000476 Fast and intuitive clustering of Web documents O. Zamir, O. Etzioni, O. Madani and R.M. Karp Proceedings of the Third International Conference on Knowledge Discovery and Data Mining. 14-17 Aug. 1997. Edited by: Heckerman, D.; Mannila, H.; Pregibon, D.; Uthurusamy, R. Menlo Park, CA, USA: AAAI Press, 1997. p. 287-90. 1997 08 __ 000003
000477 A method for obtaining randomized algorithms with small tail probabilities H. Alt, L. Guibas, K. Mehlhorn, R.M. Karp and others Algorithmica, Oct.-Nov. 1996, vol.16, (no.4-5):543-7. 1996 10 __ 000003
000478 LogP: a practical model of parallel computation D.E. Culler, R.M. Karp, D. Patterson, A. Sahay, and others Communications of the ACM, Nov. 1996, vol.39, (no.11):78-85. 1996 11 __ 000003
000479 Efficient information gathering on the Internet O. Etzioni, S. Hanks, T. Jiang, R.M. Karp and others Proceedings. 37th Annual Symposium Foundations of Computer Science, 14-16 Oct. 1996. Los Alamitos, CA, USA: IEEE Comput. Soc. Press, 1996. p. 234-43. 1996 10 __ 000003
000480 Graph traversals, genes, and matroids: an efficient case of the travelling salesman problem D. Gusfield, R.M. Karp, W. Lusheng and P. Stelling Combinatorial Pattern Matching. 7th Annual Symposium, CPM 96. Proceedings. 10-12 June 1996. Berlin, Germany: Springer-Verlag, 1996. p. 304-19. 1996 06 __ 000003
000481 Efficient PRAM simulation on a distributed memory machine. R.M. Karp, M. Luby and F. Meyer auf der Heide Algorithmica, Oct.-Nov. 1996, vol.16, (no.4-5):517-42. 1996 10 __ 000003
000482 A Neural Network Visualization and Sensitivity Analysis Toolkit Y. Liao and J. Moody Proceedings of the International Conference on Neural Information Processing, Hong Kong, Sun-ichi Amari, Lei Xu, Laiwan Chan, Irwin King, and Kwong-Sak Leung, eds. Springer Verlag Singapore Pte. Ltd. pp. 1069-74, Sept. 1996. 1996 09 __ 000003
000485 Incorporating Tandem/HATs MLP Features into SRI's Conversational Speech Recognition System Q. Zhu, A. Stolcke, B. Y. Chen, and N. Morgan Proceedings of the EARS RT-04F Workshop, Palisades, New York, November 2004. 2004 11 __ 000001 http://www.icsi.berkeley.edu/ftp/global/pub/speech/papers/EARS-RT04f-na-system.pdf
000486 The ICSI Meeting Corpus: Close-talking and Far-field, Multi-channel Transcriptions for Speech and Language Researchers J.A. Edwards LREC 2004, Workshop on Compiling and Processing Spoken Language Corpora, Lisbon, Portugal, May 2004. 2004 05 __ 000001 http://www.icsi.berkeley.edu/ftp/global/pub/speech/papers/edwards-lrec2004.pdf
000487 Auditory-based Automatic Speech Recognition W. Hemmert, M. Holmberg and D. Gelbart Proc. ISCA Tutorial and Research Workshop on Statistical and Perceptual Audio Processing, Jeju, Korea, October 2004. 2004 10 __ 000001 http://www.icsi.berkeley.edu/ftp/global/pub/speech/papers/sapa04-hemmert.pdf
000488 Vocabulary and Language Model Adaptation using Information Retrieval B. Bigi, Y. Huang and R. De Mori Proc. Intl. Conf. Spoken Language Processing, Jeju, Korea, October 2004. 2004 10 __ 000001 http://www.icsi.berkeley.edu/Speech/papers/icslp2004-bigi.pdf
000489 Learning Long-Term Temporal Features in LVCSR Using Neural Networks B. Chen, Q. Zhu and N. Morgan Proc. Intl. Conf. Spoken Language Processing, Jeju, Korea, October 2004. 2004 10 __ 000001 http://www.icsi.berkeley.edu/ftp/global/pub/speech/papers/icslp2004-byc.pdf
000490 On using MLP features in LVCSR Q. Zhu, B. Chen, N. Morgan and A. Stolcke Proc. Intl. Conf. Spoken Language Processing, Jeju, Korea, October 2004. 2004 10 __ 000001 http://www.icsi.berkeley.edu/ftp/global/pub/speech/papers/icslp2004-mlp-lvcsr.pdf
000491 Direct Modeling of Prosody: An Overview of Applications in Automatic Speech Processing E. Shriberg and A. Stolcke Proc. International Conference on Speech Prosody, Nara, Japan, March 2004. 2004 03 __ 000001 http://www.icsi.berkeley.edu/ftp/global/pub/speech/papers/shriberg_SP04_v3.pdf
000492 Prosody Modeling for Automatic Speech Recognition and Understanding E. Shriberg and A. Stolcke Mathematical Foundations of Speech and Language Modeling, M. Johnson, M. Ostendorf, S. Khudanpur, R. Rosenfeld (eds.), Volume 138 in IMA Volumes in Mathematics and its Applications, pp. 105-114, Springer-Verlag. 2004 __ __ 000001 http://www.speech.sri.com/cgi-bin/run-distill?papers/IMA-prosody.ps.gz
000484 A Minimax Arc Theorem for Reducible Flow Graphs Vijaya Ramachandran tr-87-001 1987 11 __ 000006 We establish a conjecture of Frank and Gyarfas by proving that the cardinality of a minimum feedback arc set in a reducible flow graph is equal to the cardinality of a maximum collection of arc disjoint cycles.
000493 Monitoring and Management-Support of Distributed Systems Dieter Haban, Dieter Wybranietz, Amnon Barak tr-88-007 1988 11 __ 000006 This paper describes a tool for on-line monitoring of distributed systems. The tool consists of a hardware component and software level, i.e., a hybrid monitor, which is capable of presenting the interactive user and the local operating system with a high-level information and performance evaluation of the activities in the host system with minimal interferences. A special hardware support, which consists of a test and measurement processor (TMP), was designed and has been implemented in the nodes of an experimental multicomputer system. The main function of the TMP is to execute low level operating system functions, to manage local resources and to trigger time driven events in order to reduce the overhead of the host operating system. The operations of the TMP are completely transparent to the users with a minimal, less that 0.1%, overhead to the hardware system. In the experimental system, all the TMPs were connected with a central monitoring station, using an independent communication network in order to provide a global view of the monitored system. The central monitoring station displays the resulting information in easy-to-read charts and graphs. Our experience with the TMP shows that it promotes an improved understanding of run-time behavior and performance measurements, to derive qualitative and quantitative assessments of distributed systems.
000494 Links Between Markov Models and Multilayer Perceptrons Herve Bourlard, C. J. Wellekens tr-88-008 1988 11 __ 000006 Hidden Markov models are widely used for automatic speech recognition. They inherently incorporate the sequential character of speech signal and are statistically trained. However, the a priori choice of a model topology limits the flexibility of the HMM's. Another drawback of these models is their weak discriminating power. Multilayer perceptrons are now promising tools in the connectionist approach for classification problems and have already been successfully tested on speech recognition problems. However, the sequential nature of the speech signal remains difficult to handle in that kind of machine.
In this paper, a discriminant hidden Markov model is defined and it is shown how a particular multilayer perceptron with contextual and extra feedback input units can be considered as a general form of such Markov models. Relations with other recurrent networks commonly used in speech recognition are also pointed out.
000495 Designing Computers to Check Their Work Manuel Blum tr-88-009 1988 11 __ 000006 Students, engineers, programmers...are taught to check their work. Computer programs are not. There are several reasons for this:
1. Computer hardware almost never makes errors -- but that fails to recognize that programmers unfortunately do!
2. Programs are hard enough to write without having to also write program checkers for them -- but that is the price of increased confidence!
3. There is no clear notion what constitutes a good checker. Indeed, the same students and engineers who are cautioned to check their work are rarely informed what it is that makes for a good procedure to do so -- but that is just the sort of problem that computer scientists should be able to solve!
In the view of the author, the lack of correctness checks in programs is an oversight. Programs have bugs that could perfectly well be caught by such checks. This paper urges that programs be written to check their work, and outlines a promising and rigorous approach to the study of this fascinating new area.
000496 Knowledge-Intensive Recruitment Learning Joachim Diederich tr-88-010 1988 11 __ 000006 The model described in this paper is a knowledge-intensive connectionist learning system which uses a built-in knowledge representation module for inferencing, and this reasoning capability in turn is used for knowledge-intensive learning. On the connectionist network level, the central process is the recruitment of new units and the assembly of units to represent new conceptual information. Free, uncommitted subnetworks are connected to the built-in knowledge network during learning. The goal of knowledge-intensive connectionist learning is to improve the operationality of the knowledge representation: mediated inferences, i.e., complex inferences which require several inference steps, are transformed into immediate inferences; in other words, recognition is based on the immediate excitation from features directly associated with a concept.
000497 Time, Space and Form in Vision Jerome A. Feldman tr-88-011 1988 12 __ 000006 The prodigious spatial capabilities of the primate visual system are even more remarkable when temporal considerations are taken into account. Recent advances in neurophysiology, psychophysics and computer vision provide significant constraints on how the system could work. This paper presents a fairly detailed connectionist computational model of how the perception and recognition of objects is carried out by primate brains. The model is claimed to be functionally adequate and to satisfy all the constraints established by the various disciplines. One key notion introduced is a multi-input, multi-output network for inverting spatio-temporal cues. The central construct in intermediate level motion vision is taken to be the trajectory and these are used in recognition of dynamic situations called scenarios. The entire development is an extension of the author's 1985 Four Frames model, which required relatively little modification to accommodate temporal change (eventually).
000498 On a Theory of Computation and Complexity Over the Real Numbers; NP Completeness, Recursive Functions and Universal Machines Lenore Blum, Mike Shub, Steve Smale tr-88-012 1988 12 __ 000006 We present a model for computation over the reals or an arbitrary (ordered) ring R. In this general setting, we obtain universal machines, partial recursive functions, as well as NP complete problems. While our theory reflects the classical theory over Z (e.g., the computable functions are the recursive functions) it also reflects the special mathematical character of the underlying ring R (e.g., complements of Julia sets provide natural examples of R.E. undecidable sets over the reals) and provides a natural setting for studying foundational issues concerning algorithms in numerical analysis.
000499 Program Correctness Checking and the Design of Programs That Check Their Work Manuel Blum, Sampath Kannan tr-88-013 1988 12 __ 000006 A program correctness checker is an algorithm for checking the output of a computation. This paper defines the concept of a program checker. It designs program checkers for a few specific and carefully chosen problems in the class P of problems solvable in polynomial time. It also applies methods of modern cryptography, especially the idea of a probabilistic interactive proof, to the design of program checkers for group theoretic computations. Finally it characterizes the problems that can be checked.
000500 Guaranteeing Performance for Real-Time Communication in Wide-Area Networks Domenico Ferrari tr-89-001 1989 01 __ 000006 The increasing importance of distributed multimedia applications and the emergence of user interfaces based on digital audio and digital video will soon require that computer communication networks offer real-time services. This paper argues that the feasibility for providing performance guarantees in a wide-area network should be investigated, and describes a possible approach. We present a model of the network to be studied, and discuss its generality, as well as the presumable limits to its validity in the future. We also give a careful formulation of the problem, including a precise definition of the guarantees to be provided and a provably correct scheme for the establishment of real-time connections with deterministic, statistical, and best-effort delay bounds.
000501 Pseudo-Random Number Generator From ANY One-Way Function Russell Impagliazzo, Mike Luby tr-89-002 1989 02 __ 000006 We construct a pseudo-random number generator from ANY one-way function. Previous results show how to construct pseudo-random number generators from one-way functions that have special properties (Blum and Micali [BM], Yao [Y], Levin [L1], [Goldreich, Krawczyk and Luby [GKL]). We use techniques borrowed from the theory of slightly-random sources (Santha and Vazirani [SV], Vazirani and Vazirani [VV], Vazirani [V], Chor and Goldreich [CG]) and from the theory of universal hash functions (Carter and Wegman [CW]).
We also introduce a weaker kind of one-way function, that we call an informationally one-way function. For an informationally one-way function f, given y = f(x) for a randomly chosen x, it is hard to generate uniformly a random preimage of y. We show that the existence of an informationally one-way function yields a one-way function in the usual sense, and hence a pseudo-random number generator. These results can be combined to show that the following are equivalent: (1) private key encryption; (2) bit commitment; (3) pseudo-random number generators; (4) one-way functions; (5) informationally one-way functions.
000502 Parallel Search for Maximal Independence Given Minimal Dependence Paul Beame, Michael Luby tr-89-003 1989 02 __ 000006 We consider the problem of finding a maximal independent set fast in parallel when the independence system is presented as an explicit list of minimal dependent sets. Karp and Wigderson [KW] were the first to find an NC algorithm for the special case when the size of each minimal dependent set is at most two, and subsequent work by Luby [Lu1], by Alon, Babai and Itai[ABI] and Goldberg and Spencer [GS] have introduced substantially better algorithms for this case. On the other hand, no previous work on this problem extends even to the case when the size of each minimal dependent set is at most a constant, and we conjecture that this algorithm is a randomized NC algorithm for the general case.
000503 Towards a Theory of Average Case Complexity Shai Ben-David, Benny Chor, Oded Goldreich, Michael Luby tr-89-004 1989 02 __ 000006 This paper takes the next step in developing the theory of average case complexity, a study initiated by Levin. Previous works have focused on the existence of complete problems [Le,Gu,VL]. We widen the scope to other basic questions in computational complexity. For the first time in the context of average case complexity, we show the equivalence of search and decision problems, analyze the structure of NP under P reductions, and relate the NP versus average-P to non-deterministic versus deterministic (worst case) exponential time. We also present definitions and basic theorems regarding other complexity classes, such as average log-space.
000504 A Study of Password Security Michael Luby, Charles Rackoff tr-89-005 1989 02 __ 000006 We prove relationships between the security of a function generator when used in an encryption scheme and the security of a function generator when used in a UNIX-like password scheme.
000505 Fault-Tolerant Routing in Hypercube Multicomputers Using Depth-First Search Ming-Syan Chen, Kang G. Shin tr-89-006 1989 02 __ 000006 A fault-tolerant routing scheme for hypercube multicomputers is developed using the depth-first search. The routing scheme requires a node to know only the condition (faulty or not) of its own links, and adds information on the components traversed to each message as it is routed toward the destination node.
Performance of the proposed routing scheme is rigorously analyzed. We derive an exact expression for the probability of routing messages via optimal paths (of length identical to the Hamming distance between the corresponding pair of nodes) from the source node to an obstructed node, the first node on a path determined by the above routing scheme from which no optimal path to the destination exists. Moreover, bounds for this probability are derived in closed form. The probability of routing messages via optimal paths between the source and destination can be obtained from this expression by replacing the obstructed node with the destination node. The lengths of paths obtained from this scheme are analyzed, and the scheme, despite its simplicity, is shown to be able to route messages via optimal paths with a very high probability.
Due to the absence of information at each node on components other than its own links, the actual paths chosen by the above scheme could sometimes be longer than the desired. To alleviate this deficiency, we also present a simple modification to the above routing scheme in which every node is made aware of not only the condition of its own links but also that of links one hop away from the node. The improvement of routing efficiency with this additional information at each node is analyzed.
000506 A Linear-Algorithm for Enumerating Perfect Matchings in Skew Bipartite Graphs Paul Dagum tr-89-007 1989 02 __ 000006 Let G = (U,V,E) be a bipartite graph with |E| = m, U union V = {v(subscript 1),..., v(subscript 2n)} and with the bipartition U consisting of all odd indexed vertices and V consisting of all even indexed vertices. An edge in G is always assumed to be oriented towards the endpoint with the larger index. We refer to the up (resp. down) edges of G as the edges which are oriented from an even (resp. odd) indexed vertex. If all the up edges are nested among themselves and among the down edges we say G is a skew graph. The main result of this paper is to give an O(m) algorithm to enumerate perfect matchings in skew graphs. Applications to outerplanar graphs and some problems in chemistry are given.
000507 Spreading Activation and Connectionist Models for Natural Language Processing Joachim Diederich tr-89-008 1989 02 __ 000006 High level cognitive tasks performed by an artificial neural network require both knowledge over a domain and inferencing abilities. To operate in a complex, natural environment neural networks must have robust, reliable and massively parallel inference mechanisms. This paper describes various spreading activation and connectionist mechanisms for inferencing as part of natural language processing systems, including possible techniques to enrich these systems by machine learning. In particular models which attack one or more important problems such as variable binding, knowledge-intensive learning, avoidance of cross-talk and false classifications are selected for this overview.
000508 Constructive Omega(t(superscript 1.26)) Lower Bound for the Ramsey Number R (3,t) Richard Cleve, Paul Dagum tr-89-009 1989 02 __ 000006 We present a feasibly constructive proof that R(3,t) > 5((t-1)/2)(superscript (log4/log3)) Element Omega (t(superscript 1.26)). This is, as far as we know, the first constructive superlinear lower bound for R(3,t). Also, our result yields the first feasible method for constructing triangle-free k-chromatic graphs that are polynomial-size in k.
000509 Conceptual Hierarchies in Classical and Connectionist Architecture Alfred Kobsa tr-89-010 1989 02 __ 000006 Representation systems for conceptual hierarchies have been used in the field of Artificial Intelligence for nearly two decades. They are based on symbolic representation structures and sequential processes operating upon these structures. Recently, a number of network structures have been developed in the field of Connectionism which are also claimed to be able to represent conceptual hierarchies. Processes in these networks operate in a parallel way and largely without a global control mechanism. This paper investigates the expressive power, interpretation, and inferential capabilities of these networks as compared to traditional representations, of concept hierarchies in particular to KL-ONE, a standard representation language for conceptual hierarchies in the field of natural-language processing. Although the capabilities of current connectionist hierarchies fall short of traditional representations, three inference processes will be described which can be very easily and elegantly realized in a connectionist architecture whilst they are hard and cumbersome to implement in traditional knowledge representation systems.
000510 Preemptive Ensemble Motion Planning on a Tree Greg N. Frederickson, D. J. Guan