Publication Search Results

Titlesort descendingAuthorBibliographicDateGroupLinks
Annual Report 1999ICSI Staff 1999ICSI Annual Reports[PDF]

Annual Report 2000ICSI Staff 2000ICSI Annual Reports[PDF]

Annual Report 2001ICSI Staff 2001ICSI Annual Reports[PDF]

Annual Report 2002ICSI Staff 2002ICSI Annual Reports[PDF]

Annual Report 2003ICSI Staff 2003ICSI Annual Reports[PDF]

Annual Report 2004ICSI Staff 2004ICSI Annual Reports[PDF]

Annual Report 2005ICSI StaffICSI Internal Publication 2005ICSI Annual Reports[PDF]

Annual Report 2006ICSI Staff 2006ICSI Annual Reports[PDF]

Annual Report 2007ICSI Staff 2007ICSI Annual Reports[PDF]

Annual Report 2008ICSI Staff 2008ICSI Annual Reports[PDF]

Annual Report 2009ICSI Staff 2009ICSI Annual Reports[PDF]

Annual Report 2010ICSI Staff 2010ICSI Annual Reports[PDF]

Annual Report 2011ICSI Staff 2011ICSI Annual Reports[PDF]

Answering Questions about Complex EventsS. SinhaUC Berkeley PhD dissertation, Berkeley, CaliforniaDecember 2008AI[PDF]

Answering Questions Using Advanced Semantics and Probabilistic InferenceS. Narayanan and S. HarabagiuProceedings of the Pragmatics of Question Answering Workshop at the North American Chapter of the Association for Computational Linguistics Human Language Technologies Conference (NAACL HLT 2004), Boston, MassachusettsMay 2004AI
Ant Colony Optimization for Stochastic Shortest Path ProblemsC. Horoba and D. SudholtProceedings of the Genetic and Evolutionary Computation Conference (GECCO 2010), Portland, Oregon, pp. 1465-1472July 2010Algorithms
Anthropocentric Video Segmentation for Lecture WebcastsG. Friedland and R. RojasEURASIP Journal on Image and Video Processing, Vol. 8, Issue 2, Article 9January 2008Speech[PDF]

Any Non-Private Boolean Function Is Complete For Private Multi-Party ComputationsE. Kushilevitz, S. Micali, and R. OstrovskyICSI Technical Report TR-93-076November 1993ICSI Technical Reports[PDF]

Any Questions? Automatic Question Detection in MeetingsK. Boakye, B. Favre, and D. Hakkani-TürProceedings of the 11th Biannual IEEE Workshop on Automatic Speech Recognition and Understanding (ASRU 2009), Merano, Italy, pp. 485-489December 2009Speech[PDF]

Apparent Motion and Other MysteriesJ.A. FeldmanParallel Processing in Neural Systems and Computers, pp. 479-486, R. Eckmiller, G. Hartmann, and G. Hauske (eds.), Elsevier Science Publishers B.V. 1990AI
Application of Real-Time Monitoring to Scheduling Tasks with RandomD. Haban and K. ShinICSI Technical Report TR-89-028May 1989ICSI Technical Reports[PDF]

Application-Level Multicast Using Content-Addressable NetworksS. Ratnasamy, M. Handley, R.M. Karp, and S. ShenkerProceedings of Third International Workshop on Networked Group Communication, London, Nov 2001.November 2001Networking
Applications of Keyword-Constraining in Speaker RecognitionH. LeiMS Thesis, University of California-BerkeleyJuly 2007Speech[PDF]

Applications of Topology to Lower Bound Estimates in Computer ScienceM. D. HirschICSI Technical Report TR-90-019May 1990ICSI Technical Reports[PDF]

Applying Fuzzy Logic to Model User Preferences on Multimedia SessionsJ.A. Botia, M. Valdes, P. M. Ruiz, and A.F. Gomez Skarmeta.Proceedings of the XII Congreso Espanol Sobre Tecnologias y Logica Fuzzy, Jaen, Spain, pp. 467-470September 2005Networking
Applying Large Vocabulary Hybrid HMM-MLP Methods to Telephone Recognition of Digits and Natural NumbersK. W. MaICSI Technical Report TR-95-024May 1995ICSI Technical Reports[PDF]

Applying NOX to the DatacenterA. Tavakoli, M. Casado, T. Koponen, and S. ShenkerProceedings of the 8th ACM Workshop on Hot Topics in Networks (HotNets-VIII), New York City, New YorkOctober 2009Networking[PDF]

Approaching the 5/4-Approximation for Rectilinear Steiner TreesP. Berman, U. Fössmeier, M. Karpinski, M. Kaufmann, and A. ZelikovskyICSI Technical Report TR-94-041August 1994ICSI Technical Reports[PDF]

Approximate Evaluation of a Polynomial on a Set of Real PointsV. PanICSI Technical Report TR-92-076November 1992ICSI Technical Reports[PDF]

Approximate Fair Allocation of Link BandwidthR. Pan, B. Prabhakar, L. Breslau, and S. ShenkerIEEE Micro Vol. 23, Issue 1, pp. 36-43 2003Networking
Approximate fairness through differential droppingR. Pan, L. Breslau, B. Prabhakar, and S. ShenkerComputer Communication Review, Vol. 33, Issue 2, pp. 23-39 2003Networking
Approximate Protein Folding in the HP Side Chain Model on Extended Cubic LatticesV. HeunICSI Technical Report TR-98-029December 1998ICSI Technical Reports[PDF]

Approximating Covering Problems by Randomized Search Heuristics using Multi-Objective ModelsT. Friedrich, J. He, N. Hebbinghaus, F. Neumann, and C. WittEvolutionary Computation, Vol. 18, No. 4, pp. 617-633, Winter 2010December 2010Algorithms[PDF]

Approximating Dense Cases of Covering ProblemsM. Karpinski and A. ZelikovskyICSI Technical Report TR-96-059December 1996ICSI Technical Reports[PDF]

Approximating Minimum Cuts Under InsertionM. R. HenzingerICSI Technical Report TR-94-063November 1994ICSI Technical Reports[PDF]

Approximating the Least Hypervolume Contributor : NP-Hard in General, but Fast in PracticeK. Bringmann and T. FriedrichProceedings of the Fifth International Conference on Evolutionary Multi-Criterion Optimization (EMO 2009), Nantes, France, pp. 6-20April 2009Algorithms[PDF]

Approximating the Number of Solutions of a GF[2] PolynomialM. Karpinski and M. LubyICSI Technical Report TR-90-025July 1990ICSI Technical Reports[PDF]

Approximating the Permanent of Graphs with Large FactorsP. Dagum and M. LubyICSI Technical Report TR-89-023April 1989ICSI Technical Reports[PDF]

Approximating the Volume of Unions and Intersections of High-Dimensional Geometric ObjectsK. Bringmann and T. FriedrichProceedings of International Symposium on Algorithms and Computation (ISAAC), Gold Coast, Australia, pp. 436-447December 2008Algorithms[PDF]

Approximating the Volume of Unions and Intersections of High-Dimensional Geometric ObjectsK. Bringmann and T. FriedrichComputational Geometry, Vol. 43, Issues 6-7, pp. 601-610August 2010Algorithms[PDF]

Approximation Algorithms for Data Management in NetworksC. Krick, H. Racke, and M. WestermannProceedings of the Thirteenth ACM Symposium on Parallel Algorithms and Architectures (SPAA) pp. 237-246, 2001. 2001Algorithms
Approximation Algorithms for Data Management in NetworksC. Krick, H. Racke, and M. WestermannTheory of Computing Systems, 2001. 2001Algorithms
Approximation and Collusion in Multicast Cost SharingJ. Feigenbaum, A. Krishnamurthy, R. Sami, and S. ShenkerProceedings of the Third ACM Conference on Electronic Commerce (ACM-EE 2001), Tampa, Florida, pp. 253-255October 2001Networking
Approximation and Collusion in Multicast Cost SharingJ. Feigenbaum, A. Archer, A. Krishnamurthy, R. Sami, and S. ShenkerGames and Economic Behavior, Vol. 47, Issue 1, pp. 36-71April 2004Networking[PDF]

Approximation of Complex Numbers by Cyclotomic IntegersM. A. Shokrollahi and V. StemannICSI Technical Report TR-96-033August 1996ICSI Technical Reports[PDF]

Appscio: A Software Environment for Semantic Multimedia AnalysisG. Friedland, E. Hensley, J. Schumacher, and R. JainProceedings of IEEE International Conference on Semantic Computing, Santa Clara, California, pp. 456-459August 2008Speech[PDF]

Aproximacion de Arboles Multicast Optimos en Redes Ad Hoc InalambricasP.M. Ruiz and A.F. Gomez SkarmetaProceedings of the V Jornadas de Ingenieria Telematica, Vigo, SpainSeptember 2005Networking
Architectural Considerations for Playback of Quality Adaptive Video over the InternetR. Rejaie, M. Handley, and D. EstrinTechnical report 98-686, Computer Science Department, University of Southern California 1998Networking
Architectural Patterns for RFID Applications in ManufacturingH. Ziekow, L. Ivantysynova, and O. GuentherProceedings of the 18th European Conference on Information Systems (ECIS 2010), Pretoria, South AfricaJune 2010Other
Architecture Selection Strategies for Neural Networks: Application to Corporate Bond Rating PredictionJ. Moody and J. UtansNeural Networks in the Capital Markets, Refenes A. N. (ed), John Wiley & Sons, New York 1994Algorithms

Pages