Publication Search Results

TitleAuthorsort ascendingBibliographicDateGroupLinks
Communication Performance ModelsS. BöckingICSI Technical Report TR-95-013March 1995ICSI Technical Reports[PDF]

RFC 4653: Improving the Robustness of TCP to Non-Congestion EventsS. Bhandarkar, A.L.N. Reddy, M. Allman, and E. BlantonRequest for Comments 4653 (Experimental)August 2006Networking
Automatically Generated Prosodic Cues to Lexically Ambiguous Dialog Acts in Multiparty MeetingsS. Bhagat, H. Carvey, and E. ShribergProceedings of the 15th International Congress of Phonetic Sciences (ICPhS 2003), Barcelona, SpainAugust 2003Speech[PDF]

Towards a Theory of Average Case ComplexityS. Ben-David, B. Chor, O. Goldreich, and M. LubyICSI Technical Report TR-89-004February 1989ICSI Technical Reports[PDF]

On the Theory of Average Case Complexity (Revised Edition)S. Ben-David, B. Chor, O. Goldreich, and M. LubyICSI Technical Report TR-89-055September 1989ICSI Technical Reports[PDF]

On the power of randomization in on-line algorithmsS. Ben-David, A. Borodin, R. M. Karp, G. Tardos, and A. WigdersonAlgorithmica, Vol. 11, No. 1, pp. 2-14January 1994Algorithms
On the power of randomization in online algorithmsS. Ben-David, A. Borodin, R. M. Karp, G. Tardos, and A. WigdersonProceedings of the 22nd Annual ACM Symposium on Theory of Computing, Baltimore, Maryland, pp. 379-86May 1990Algorithms
On the Power of Randomization in Online AlgorithmsS. Ben David, A. Borodin, R. Karp, G. Tardos, and A. WigdersonICSI Technical Report TR-90-023June 1990ICSI Technical Reports[PDF]

Designing Multi-Socket Systems Using Silicon PhotonicsS. Beamer, K. Asanović, C. Batten, A. Joshi, and V. StojanovićProceedings of the 23rd International Conference on Supercomputing (ICS-09), Yorktown Heights, New York, pp. 521-522June 2009Architecture[PDF]

Direction-Optimizing Breadth-First SearchS. Beamer, K. Asanović, and D. PattersonProceedings of the International Conference for High Performance Computing, Networking, Storage, and Analysis (SC12), Article No. 12, Salt Lake City, UtahNovember 2012Architecture
Re-Architecting DRAM Memory Systems with Monolithically Integrated Silicon PhotonicsS. Beamer, C. Sun, Y.-J. Kwon, A. Joshi, C. Batten, V. Stojanović, and K. AsanovićProceedings of the 37th International Symposium on Computer Architecture (ISCA 2010), Saint-Malo, France, pp. 129-140June 2010Architecture[PDF]

Computing Single Source Shortest Paths Using Single-Objective Fitness FunctionsS. Baswana, S. Biswas, DB. Doerr, T. Friedrich, P. Kurur, and F. NeumannProceedings of the 10th Foundations of Genetic Algorithms Workshop (FOGA X), Orlando, Florida, pp. 59-66January 2009Algorithms[PDF]

SmartSeer: Using a DHT to Process Continuous Queries over Peer-to-Peer NetworksS. Banerjee, S. Basu, J. Kannan, S. J. Lee, P. Sharma, S. Shenker, and B. YangProceedings of the 25th Annual IEEE Conference on Computer Communications (INFOCOM), Barcelona, Spain, pp. 1-12April 2006Networking[PDF]

Uniform versus Priority Dropping for Layered VideoS. Bajaj, L. Breslau, and S. ShenkerACM Computer Communication Review, Vol. 28, pp. 131-143September 1998Networking
The Contribution of Framenet to Practical LexicographyS. Atkins, M. Rundell, and H. SatoInternational Journal of Lexicography, Volume 16.3: 333-357. 2003. 2003AI
Lexicographic Relevance: Selecting Information From Corpus EvidenceS. Atkins, C.J. Fillmore, and C.R. JohnsonInternational Journal of Lexicography, Volume 16.3: 251-280. 2003. 2003AI
Polynomial Time Approximation Schemes for Dense Instances of $NP$-HardProblemsS. Arora, D. Karger, and M. KarpinskiICSI Technical Report TR-95-011March 1995ICSI Technical Reports[PDF]

On Preserving Privacy in Information-Centric NetworksS. Arianfar, T. Koponen, B. Raghavan, and S. ShenkerProceedings of the ACM SIGCOMM Workshop on Information-Centric Networking (ICN-2011), Toronto, Canada, pp. 19-24August 2011Networking[PDF]

Checking Approximate Computations Over the RealsS. Ar, M. Blum, B. Codenotti, and P. GemmellICSI Technical Report TR-92-030May 1992ICSI Technical Reports[PDF]

A Combined BIT and TIMESTAMP Algorithm for the List Update ProblemS. Albers, B. von Stengel, and R. WerchnerICSI Technical Report TR-95-016April 1995ICSI Technical Reports[PDF]

Average Case Analyses of List Update Algorithms, with Applications to Data CompressionS. Albers and M. MitzenmacherICSI Technical Report TR-95-039August 1995ICSI Technical Reports[PDF]

Improved Randomized On-Line Algorithms for the List Update ProblemS. AlbersICSI Technical Report TR-94-071December 1994ICSI Technical Reports[PDF]

A Network for Extracting the Locations of Point Clusters Using Selective AttentionS. Ahmad and S. OmohundroICSI Technical Report TR-90-011May 1990ICSI Technical Reports[PDF]

Efficient Visual Search: A Connectionist SolutionS. Ahmad and S. OmohundroICSI Technical Report TR-91-040July 1991ICSI Technical Reports[PDF]

VISIT: An Efficient Computational Model Of Human Visual AttentionS. AhmadICSI Technical Report TR-91-049September 1991ICSI Technical Reports[PDF]

Universal Foci and Varying Boundaries in Linguistic Color CategoriesR.S. Cook, P. Kay, and T. RegierProceedings of the 27th Annual Conference of the Cognitive Science Society (CogSci 2005), Stresa, Italy, pp. 1827-1832July 2005AI
The World Color Survey Database: History and UseR.S. Cook, P. Kay, and T. RegierHandbook of Categorisation in the Cognitive Sciences, H. Cohen and C. Lefebvre, eds., pp. 224-242, Elsevier 2005AI
A Simple Algorithm for Finding Frequent Elements in Streams and BagsR.M. Karp, S. Shenker, and C.H. PapadimitriouTransactions on Database Systems 2003Algorithms
A Simple Algorithm for Finding Frequent Elements in Streams and BagsR.M. Karp, S. Shenker, and C.H. PapadimitriouACM Transactions on Database Systems, Vol. 28, Issue 1, pp. 51-55March 2003Networking[PDF]

Efficient PRAM Simulation on a Distributed Memory MachineR.M. Karp, M. Luby, and F. Meyer auf der HeideAlgorithmica, Vol. 16, No. 4-5, pp. 517-42October 1996Algorithms
Finite-Length Analysis of LT-codesR.M. Karp, M. Luby, and A. ShokrollahiProceedings of International Symposium on Information Theory (ISIT)January 05 2004Algorithms
Finite-Length Analysis of LT-codesR.M. Karp, M. Luby, and A. ShokrollahiSubmitted to International Symposium on Information Theory (ISIT '04). 2004Networking
The complexity of parallel searchR.M. Karp, E. Upfal, and A. WigdersonJournal of Computer and System Sciences, Vol. 36, No. 2. Also in the proceedings of the 17th Annual ACM Symposium on the Theory of Computing, Providence, Rhode Island, May 1985, pp. 225-53April 1988Algorithms
Optimization Problems in Congestion ControlR.M. Karp, E. Koutsoupias, C.H. Papadimitriou, and S. ShenkerProceedings of the 41st Annual Symposium on Foundations of Computer Science (FOCS 2000), Redondo Beach, California, pp. 66-74November 2000Networking[PDF]

Error-Resilient DNA Computation. Random Structures & Algorithms, Random StructR.M. Karp, C. Kenyon, and O. WaartsAlgorithms (USA), vol.15, (no.3-4), Wiley, Oct.-Dec. 1999. p.450-66. 19October 1999Algorithms
Average case analysis of a heuristic for the assignment problemR.M. Karp, A.H.G. Rinnooy Kan, and R.V. VohraMathematics of Operations Research, Vol. 19, No. 3, pp. 513-22August 1994Algorithms
Load Balancing in Structured P2P SystemsR.M. Karp, A. Rao, K. Lakshminarayanan, S. Surana, and I. StoicaProceedings of the Second International Workshop on Peer-to-Peer Systems 2003Algorithms
On Parallel Evaluation of Game TreesR.M. Karp and Y. ZhangJournal of the ACM, Nov. 1998, vol.45, (no.6):1050-75. 1998Algorithms
Algorithms for Optical MappingR.M. Karp and R. ShamirJournal of Computational Biology 7(1,2) 2000. 2000Networking
Algorithms for Optical MappingR.M. Karp and R. ShamirRECOMB 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. 1998Algorithms
A Gambling Game and its Application to the Analysis of Adaptive Randomized RoundingR.M. Karp and C. KenyonSpringer-Verlag Lecture Notes in Computer Science, Volume 2764 (RANDOM 03), 329-340 2003Algorithms
Variations on the Theme of "Twenty Questions"R.M. KarpProceedings of the 1998 IEEE International Symposium on Information Theory, Aug. 1998. New York, NY, USA: IEEE, 1998. p. 3.August 1998Algorithms
The Design and Evaluation of Routing Algorithms for Real-Time ChannelsR. WidyonoICSI Technical Report TR-94-024June 1994ICSI Technical Reports[PDF]

Source Separation Based on Binaural Cues and Source Model ConstraintsR. Weiss, M. Mandel, and D. EllisProceedings of the 9th International Conference of the ISCA (Interspeech 2008), Brisbane, Australia, pp. 419-422September 2008Speech[PDF]

Topologically-Constrained Latent Variable ModelsR. Urtasun, D. J. Fleet, A. Geiger, J. Popovic, T. Darrell, and N. D. LawrenceProceedings of International Conference on Machine Learning (ICML), Helsinki, Finland, pp. 1080-1087July 2008Vision[PDF]

Rank Priors for Continuous Non-Linear Dimensionality ReductionR. Urtasun, A. Geiger, and T. DarrellPresented at the Learning Workshop (Snowbird), Clearwater, FloridaApril 2009Vision[PDF]

Local Probabilistic Regression for Activity-Independent Human Pose InferenceR. Urtasun and T. DarrellProceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), Anchorage, AlaskaJune 2008Vision[PDF]

Non-Parametric Latent Variable Models for Shape and Motion AnalysisR. UrtasunInvited talk at the Third International Conference on Computer Vision/Computer Graphics Collaboration Techniques (MIRAGE 2009), Versailles, FranceMay 2009Vision
Managing ABR Capacity in Reservation-based Slotted NetworksR. Ulrich and P. KritzingerICSI Technical Report TR-96-006January 1996ICSI Technical Reports[PDF]

A Management Platform for Global Area ATM NetworksR. UlrichICSI Technical Report TR-96-018May 1996ICSI Technical Reports[PDF]

Pages