サクサク読めて、アプリ限定の機能も多数!
トップへ戻る
ノーベル賞
www.cs.umd.edu/~tomg
Overview This paper studies the art and science of creating adversarial attacks on object detectors. Most work on real-world adversarial attacks has focused on classifiers, which assign a holistic label to an entire image, rather than detectors which localize objects within an image. Detectors work by considering thousands of “priors” (potential bounding boxes) within the image with different loca
www.cs.umd.edu
www.cs.umd.edu/~abadi
Design Principles for Scaling Multi-core OLTP Under High Contention Kun Ren Yale University kun.ren@yale.edu Jose M. Faleiro Yale University jose.faleiro@yale.edu Daniel J. Abadi Yale University dna@cs.yale.edu ABSTRACT Although significant recent progress has been made in improving the multi-core scalability of high throughput transactional database systems, modern systems still fail to achieve s
www.cs.umd.edu/~avik
Avik Chaudhuri Software Engineer, Facebook [CV | Research Statement | Projects | Papers | Software] My research interests span the areas of programming languages and computer security. I have recently joined the HipHop Team at Facebook. Previously, I was a member of the Programming Language Research Group at Adobe Systems, where I focused on the future of the ActionScript language and the Flash pl
www.cs.umd.edu/~miyyer
A Neural Network for Factoid Question Answering over Paragraphs Mohit Iyyer, Jordan Boyd-Graber, Leonardo Claudino, Richard Socher, and Hal Daumé III In Proceedings of EMNLP 2014, download PDF here UPDATE (10/19/15): A much larger dataset that contains 20,407 questions about 2,347 answers has been released here (31 MB). This dataset includes questions about various categories (not just history and
VLDB 2009 Tutorial Column-Oriented Database Systems 1 Re-use permitted when acknowledging the original © Stavros Harizopoulos, Daniel Abadi, Peter Boncz (2009) Column-Oriented Database Systems Part 1: Stavros Harizopoulos (HP Labs) Part 2: Daniel Abadi (Yale) Part 3: Peter Boncz (CWI) VLDB 2009 Tutorial VLDB 2009 Tutorial Column-Oriented Database Systems 2 Re-use permitted when acknowledging the o
www.cs.umd.edu/~mwh
The End of an Architectural Era (It’s Time for a Complete Rewrite) Michael Stonebraker Samuel Madden Daniel J. Abadi Stavros Harizopoulos MIT CSAIL {stonebraker, madden, dna, stavros}@csail.mit.edu Nabil Hachem AvantGarde Consulting, LLC nhachem@agdba.com Pat Helland Microsoft Corporation phelland@microsoft.com ABSTRACT In previous papers [SC05, SBC+07], some of us predicted the end of “one size f
www.cs.umd.edu/~samir
Industry Report 76 JANUARY • FEBRUARY 2003 Published by the IEEE Computer Society 1089-7801/03/$17.00©2003 IEEE IEEE INTERNET COMPUTING Amazon.com Recommendations Item-to-Item Collaborative Filtering R ecommendation algorithms are best known for their use on e-commerce Web sites,1 where they use input about a cus- tomer’s interests to generate a list of recommend- ed items. Many applications use o
Project description NVSS 1.0 (Network Visualization by Semantic Substrates) enables users to specify regions to place nodes, and then control over link visibility. (Left Figure) With all CITES boxes checked, there are 260 black Supreme to Supreme citations and 89 red Circuit to Supreme citations. Users can limit the links by source and target regions of interest. For example, in the left figure, l
MANAGING THE DEVELOPMENT OF LARGE SOFTWARE SYSTEMS Dr. Winston W. Rovce INTRODUCTION l am going to describe my pe,-.~onalviews about managing large software developments. I have had various assignments during the past nit,.: years, mostly concerned with the development of software packages for spacecraft mission planning, commanding and post-flight analysis. In these assignments I have experience
Overview Diamondback Ruby (DRuby) is an extension to Ruby that aims to bring the benefits of static typing to Ruby without compromising the expressiveness of the language. The main features of DRuby are: Type inference: DRuby uses inference to model most of Ruby’s idioms as precisely as possible without any need for programmer intervention. Type annotations: Methods may be given explicit type anno
Presentation Tips General: Main page History Presentation Tips General Links Software on windows: Power Point Freelance Graphics Harvard Graphics Software on other OS/Platform: Latex-based All right. This is not about interface, but it helps for your representation. Edward R. Tufte’s Presentation Tips Show up early Something good is bound to happen—if there’s no need to fix a mech
Arrowlets is a JavaScript library that uses the concept of arrows to make the task of composing event-handlers easy. Event handlers are written as normal functions, as you would today, and Arrowlets provide flexible combinators to easily compose sequence of events, animation, asynchronous network access, and making long-running computations while keeping the UI responsive. For a tutorial, Chris Ei
Cheney's Algorithm is a method of performing a copying garbage collection using semi-spaces, that is, it works by splitting heap memory into two parts and only using one at a time. Essentially, at any given moment there is an active part of memory from which new objects are allocated. When conditions get such that a garbage collection is needed, the live objects of the active part of memory are
Darnell-Kanal Professor of Computer Science University of Maryland, College Park 8125 Paint Branch Drive College Park, MD 20742 Send Daniel Abadi an email Bio Prof. Abadi performs research on database system architecture and implementation, especially at the intersection with scalable and distributed systems. He is best-known for the development of the storage and query execution engines of the C-
www.cs.umd.edu/~pugh
Introduction to Statistical Relational Learning Edited by Lise Getoor and Ben Taskar Published by The MIT Press Handling inherent uncertainty and exploiting compositional structure are fundamental to understanding and designing large-scale systems. Statistical relational learning builds on ideas from probability theory and statistics to address uncertainty while incorporating tools from logic, dat
www.cs.umd.edu/~mount
Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, and Angela Y. Wu This is a collection of C++ procedures for performing k-means clustering based on a combination of local search and Lloyd's algorithm (also known as the k-means algorithm). Given any set of k centers Z, for each center z in Z, let V(z) denote its neighborhood, that is, the set of data points f
www.cs.umd.edu/~jfoster
New! We have switched the project over to subversion rather than cvs, so you should use that if you wish to check out the latest version. Oink is a new C/C++ toolkit that includes Cqual++, a C/C++ frontend for Cqual. Oink was developed by Dan Wilkerson. Version 0.991, a bugfix version, is available. (If you want to use flow-sensitive qualifiers, you should use version 0.981 instead.) For questions
www.cs.umd.edu/~jkatz
Introduction to Modern Cryptography is an introductory-level treatment of cryptography written from a modern, computer science perspective. It is unique in its blend of theory and practice, covering standardized cryptosystems widely used in practice without sacrificing rigor or an emphasis on foundations. It is intended to be used as a textbook in undergraduate- or graduate-level introductory cour
SocialAction: Integrating Statistics and Visualization for Social Network Analysis SocialAction is a social network analysis tool that integrates visualization and statistics to improve the analytical process. LATEST NEWS A journal article about SocialAction was recently published in IEEE Computer Graphics and Applications. See the full details in the papers below. SocialAction won a VAST Mini-Cha
Piccolo is now being maintained and distributed by a very active volunteer group at www.piccolo2d.org. We'll leave this site here for history, but it is no longer being maintained. A Structured 2D Graphics Framework Welcome to Piccolo! A revolutionary way to create robust, full-featured graphical applications in Java and C#, with striking visual effects such as zooming, animation and multiple repr
www.cs.umd.edu/~getoor
index.shtml
Treemaps for space-constrained visualization of hierarchies Including the History of Treemap Research at the University of Maryland Started Dec. 26th, 1998 by Ben Shneiderman Later updates by Ben Shneiderman and Catherine Plaisant - Last update Sept 2014 Our treemap products: Treemap 4.0: General treemap tool (Free demo version, plus licensing information for full package) PhotoMesa: Zoomable imag
Project description Treemap is a space-constrained visualization of hierarchical structures. It is very effective in showing attributes of leaf nodes using size and color coding. Treemap enables users to compare nodes and sub-trees even at varying depth in the tree, and help them spot patterns and exceptions. Treemap was first designed by Ben Shneiderman during the 1990s. For more information, rea
次のページ
このページを最初にブックマークしてみませんか?
『UMD Department of Computer Science』の新着エントリーを見る
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く