Search results for "Washington"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
55	Roger Segelken	A Case History of a Computer Media Event - Introducing a Supercomputer Center.	SIGDOC	1985	DBLP DOI BibTeX RDF
44	Susan L. Graham, Deborah Estrin, Eric Horvitz, Isaac S. Kohane, Elizabeth D. Mynatt, Ida Sim	Information Technology research challenges for healthcare: from discovery to delivery.	SIGHIT Rec.	2011	DBLP DOI BibTeX RDF
44	Andrew P. Black, Norman C. Hutchinson, Eric Jul, Henry M. Levy	The development of the Emerald programming language.	HOPL	2007	DBLP DOI BibTeX RDF	Eden, Emerald, Washington, call-by-move, object mobility, remote object invocation, type conformity, mobility, object-oriented programming, polymorphism, distributed programming, remote procedure call, abstract types
44	Omid E. Kia, David S. Doermann	OCR-based rate-distortion analysis of residual coding.	ICIP (3)	1997	DBLP DOI BibTeX RDF	rate-distortion analysis, OCR evaluation software, symbolic compression, representative prototypes, row-order coding, distance-order coding, distortion measure, OCR system performance, University of Washington, document database images, lossy representation, experiments, optical character recognition, redundancy, image coding, progressive transmission, document images, lossy compression, ground truth, residual coding, compressed-domain processing
37	M. Pauli, M. C. Ertem, E. Heidhausen	Quick Response Airborne Deployment of Viper Muzzle Flash Detection and Location System During DC Sniper Attacks.	AIPR	2003	DBLP DOI BibTeX RDF
37	Abbie Brown	Washington State University.	Interactions	2002	DBLP DOI BibTeX RDF
35	Surakshya Aryal, Mikel K. Ngueajio, Saurav Keshari Aryal, Gloria J. Washington	Hey, Siri! Why Are You Biased against Women? (Student Abstract).	AAAI	2023	DBLP DOI BibTeX RDF
35	Robin Littlejohn, Kristen E. Miller, Sadaf Kazi, Christopher Washington, Zach McGill, Doug DeBold, Emma Eikermann, Shrey Mathur, Joseph Blumenthal, Shrenikkumar Shah, Christopher W. Bonk, Ronald E. Romero Barrientos, Aaron Z. Hettinger, Roland E. Gamache	Opioid Tapering Application Pilot: Strategies, Facilitators, and Barriers to Implementation of a Clinical Decision Support Solution for Chronic Pain Management.	AMIA	2022	DBLP BibTeX RDF
35	Brittani S. Washington, Jinjuan Heidi Feng	Proper Implementation of Website Features Affecting the Use of Screen Readers.	AHFE (21)	2019	DBLP DOI BibTeX RDF
35	Anne M. Washington, Weidner Weidner	Collaborative Metadata Application Profile Development for DAMS Migration.	Dublin Core Conference	2017	DBLP BibTeX RDF
35	John Taylor Chavis III, Amy L. Cochran, Keith E. Kocher, Valerie N. Washington, Gabriel Zayas-Cabán	A simulation model of patient flow through the emergency department to determine the impact of a short stay unit on hospital congestion.	WSC	2016	DBLP DOI BibTeX RDF
35	Howard Sueing, Jahmahrae Jackson, Alicia Nicki Washington, Mugizi Robert Rwebangira, Legand Burge	The Modeling and Analysis of the Washington Metropolitan Area Bus Network.	MSV	2010	DBLP BibTeX RDF
35	Washington Mio, Anuj Srivastava	Elastic-String Models for Representation and Analysis of Planar Shapes.	CVPR (2)	2004	DBLP DOI BibTeX RDF
35	Stéphane Cardon, Abdel-Illah Mouaddib, Shlomo Zilberstein, Richard Washington	Adaptive Control of Acyclic Progressive Processing Task Structures.	IJCAI	2001	DBLP BibTeX RDF
35	Jason Sampson, Elwood Coslett, Bob Paauwe, Russ Craft, Gary Washington, Kevin Wheeler	Deployment of Microsoft Windows NT in a Design Engineering Environment.	LISA-NT	1999	DBLP BibTeX RDF
33	Janice C. Sipior, Laurie Schatzberg, Dorothy E. Leidner, Diane Lending, Susan A. Vowels	From the chair.	Data Base	2004	DBLP DOI BibTeX RDF
33	Jason R. W. Merrick, Johan René van Dorp, Thomas A. Mazzuchi, John R. Harrald	Modeling risk in the dynamic environment of maritime transportation.	WSC	2001	DBLP DOI BibTeX RDF
30	Mary Wootters, Laura Sanità (eds.)	Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference).	APPROX-RANDOM	2021	DBLP BibTeX RDF
30	Chien-Chung Huang, François Sellier	Semi-Streaming Algorithms for Submodular Function Maximization Under b-Matching Constraint.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Susanne Albers, Sebastian Schubert	Optimal Algorithms for Online b-Matching with Variable Vertex Capacities.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Sankeerth Rao Karingula, Shachar Lovett	Singularity of Random Integer Matrices with Large Entries.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Anupam Gupta 0001, Amit Kumar 0001, Sahil Singla 0001	Bag-Of-Tasks Scheduling on Related Machines.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Rocco A. Servedio, Li-Yang Tan	Deterministic Approximate Counting of Polynomial Threshold Functions via a Derandomized Regularity Lemma.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Allan Borodin, Calum MacRury, Akash Rakheja	Secretary Matching Meets Probing with Commitment.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Chandan Saha 0001, Bhargav Thankey	Hitting Sets for Orbits of Circuit Classes and Polynomial Families.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Inbar Ben Yaacov, Gil Cohen, Anand Kumar Narayanan	Candidate Tree Codes via Pascal Determinant Cubes.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Omar Alrabiah, Venkatesan Guruswami	Visible Rank and Codes with Locality.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Anup Bhattacharya, Dishant Goyal, Ragesh Jaiswal	Hardness of Approximation for Euclidean k-Median.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Rikhav Shah, Sandeep Silwal	Smoothed Analysis of the Condition Number Under Low-Rank Perturbations.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30		Front Matter, Table of Contents, Preface, Conference Organization.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	David G. Harris 0001, Fotis Iliopoulos, Vladimir Kolmogorov	A New Notion of Commutativity for the Algorithmic Lovász Local Lemma.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Umang Bhaskar, A. R. Sricharan, Rohit Vaish	On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda	The Swendsen-Wang Dynamics on Trees.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Kuikui Liu	From Coupling to Spectral Independence and Blackbox Comparison with the Down-Up Walk.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Brian Brubach, Nathaniel Grammel, David G. Harris 0001, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti	Approximating Two-Stage Stochastic Supplier Problems.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Arijit Bishnu, Arijit Ghosh, Gopinath Mishra	Distance Estimation Between Unknown Matrices Using Sublinear Projections on Hamming Cube.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Ralf Borndörfer, Katrin Casel, Davis Issac, Aikaterini Niklanovits, Stephan Schwartz, Ziena Zeif	Connected k-Partition of k-Connected Graphs and c-Claw-Free Graphs.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Varsha Dani, Diksha Gupta, Thomas P. Hayes	On the Power of Choice for k-Colorability of Random Graphs.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Reut Levi, Nadav Shoshan	Testing Hamiltonicity (And Other Problems) in Minor-Free Graphs.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Chandra Chekuri, Kent Quanrud, Manuel R. Torres	Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan	Parallel Repetition for the GHZ Game: A Simpler Proof.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Hossein Jowhari	An Estimator for Matching Size in Low Arboricity Graphs with Two Applications.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Anna Arutyunova, Anna Großwendt, Heiko Röglin, Melanie Schmidt 0001, Julian Wargalla	Upper and Lower Bounds for Complete Linkage in General Metric Spaces.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Talya Eden, Saleet Mossel, Ronitt Rubinfeld	Sampling Multiple Edges Efficiently.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Jaroslaw Blasiok, Peter Ivanov, Yaonan Jin, Chin Ho Lee, Rocco A. Servedio, Emanuele Viola	Fourier Growth of Structured 2-Polynomials and Applications.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Sepehr Assadi, Soheil Behnezhad	On the Robust Communication Complexity of Bipartite Matching.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Sandip Banerjee, Rafail Ostrovsky, Yuval Rabani	Min-Sum Clustering (With Outliers).	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Elena Grigorescu, Young-San Lin, Kent Quanrud	Online Directed Spanners and Steiner Forests.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar	Query Complexity of Global Minimum Cut.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Dean Doron, Raghu Meka, Omer Reingold, Avishay Tal, Salil P. Vadhan	Pseudorandom Generators for Read-Once Monotone Branching Programs.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Sumegha Garg, Pravesh K. Kothari, Pengda Liu, Ran Raz	Memory-Sample Lower Bounds for Learning Parity with Noise.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Sourav Chakraborty 0001, Arijit Ghosh, Gopinath Mishra, Sayantan Sen	Interplay Between Graph Isomorphism and Earth Mover's Distance in the Query and Communication Worlds.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Guy Blanc, Jane Lange, Mingda Qiao, Li-Yang Tan	Decision Tree Heuristics Can Fail, Even in the Smoothed Setting.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Karl Bringmann, Alejandro Cassis, Nick Fischer, Marvin Künnemann	Fine-Grained Completeness for Optimization in P.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Yi Li 0002, David P. Woodruff	The Product of Gaussian Matrices Is Close to Gaussian.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Louis Golowich	Improved Product-Based High-Dimensional Expanders.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Srikanth Srinivasan 0001, S. Venkitesh	On the Probabilistic Degree of an n-Variate Boolean Function.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Eun Jung Kim 0002, Euiwoong Lee, Dimitrios M. Thilikos	A Constant-Factor Approximation for Weighted Bond Cover.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Uma Girish, Ran Raz, Wei Zhan	Lower Bounds for XOR of Forrelations.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Waldo Gálvez, Fabrizio Grandoni 0001, Afrouz Jabal Ameli, Kamyar Khodamoradi	Approximation Algorithms for Demand Strip Packing.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz	General Knapsack Problems in a Dynamic Setting.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Ninad Rajgopal, Rahul Santhanam	On the Structure of Learnability Beyond P/Poly.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	William M. Hoza	Better Pseudodistributions and Derandomization for Space-Bounded Computation.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Rajesh Jayaram, John Kallaugher	An Optimal Algorithm for Triangle Counting in the Stream.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Aditya Parulekar, Advait Parulekar, Eric Price 0001	L1 Regression with Lewis Weights Subsampling.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar 0001, Madhu Sudan 0001	Ideal-Theoretic Explanation of Capacity-Achieving Decoding.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Kshipra Bhawalkar, Kostas Kollias, Manish Purohit	Revenue Maximization in Transportation Networks.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Max A. Deppert, Klaus Jansen, Arindam Khan 0001, Malin Rau, Malte Tutas	Peak Demand Minimization via Sliced Strip Packing.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	János Balogh, Ilan Reuven Cohen, Leah Epstein, Asaf Levin	Truly Asymptotic Lower Bounds for Online Vector Bin Packing.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Noah Singer, Madhu Sudan 0001, Santhoshini Velusamy	Streaming Approximation Resistance of Every Ordering CSP.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Arindam Khan 0001, Eklavya Sharma	Tight Approximation Algorithms For Geometric Bin Packing with Skewed Items.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Antonio Blanca, Alistair Sinclair, Xusheng Zhang	The Critical Mean-Field Chayes-Machta Dynamics.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Omar El Housni, Vineet Goyal, Oussama Hanguir, Clifford Stein 0001	Matching Drivers to Riders: A Two-Stage Robust Approach.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Andreas Galanis, Leslie Ann Goldberg, James Stewart 0001	Fast Mixing via Polymers for Random Graphs with Unbounded Degree.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Sumanta Ghosh, Rohit Gurjar	Matroid Intersection: A Pseudo-Deterministic Parallel Reduction from Search to Weighted-Decision.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Fotis Iliopoulos	Improved Bounds for Coloring Locally Sparse Hypergraphs.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Vishwas Bhargava, Sumanta Ghosh	Improved Hitting Set for Orbit of ROABPs.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Christian Konrad 0001, Kheeran K. Naidu	On Two-Pass Streaming Algorithms for Maximum Bipartite Matching.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Amartya Shankha Biswas, Talya Eden, Ronitt Rubinfeld	Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Alexander Göke, Jochen Könemann, Matthias Mnich, Hao Sun	Hitting Weighted Even Cycles in Planar Graphs.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Zvika Brakerski, Noah Stephens-Davidowitz, Vinod Vaikuntanathan	On the Hardness of Average-Case k-SUM.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
30	Alexander Furnas	Coalitions and coordination in Washington think tanks: board interlock among Washington D.C.-based policy research and planning organizations.	Appl. Netw. Sci.	2020	DBLP DOI BibTeX RDF
30	Benito O. Perez, Yiwei Ma, Mengran Wang, Xiaomeng Liang, Negin Askarzadeh	Towards a more meterless parking system: Understanding meter payment behavior and trends in Washington, DC.	IEEE BigData	2016	DBLP DOI BibTeX RDF
30	Nidhi Kiranbhai Parikh, Mina Youssef, Samarth Swarup, Stephen G. Eubank, Youngyun Chungbaek	Cover Your Cough! Quantifying the Benefits of a Localized Healthy Behavior Intervention on Flu Epidemics in Washington DC.	SBP	2014	DBLP DOI BibTeX RDF
30	Stacey Chambers	The National Security Archive. The George Washington University, Suite 701, Gelman Library, 2130 H Street, NW, Washington, DC 20037, Retrieved November 1, 2012, from http: //www.nsarchive.org.	Gov. Inf. Q.	2013	DBLP DOI BibTeX RDF
30	Kathleen Forsythe, Alan Grosenheider, Eileen Llona, Jennifer L. Ward	University of Washington Early Buddhist Manuscripts Project in DSpace.	Dublin Core Conference	2003	DBLP BibTeX RDF
30	Jack S. Breese, Daphne Koller (eds.)	UAI '01: Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence, University of Washington, Seattle, Washington, USA, August 2-5, 2001	UAI	2001	DBLP BibTeX RDF
30	Blai Bonet	A Calculus for Causal Relevance.	UAI	2001	DBLP BibTeX RDF
30	Thomas Lukasiewicz	Probabilistic Logic Programming under Inheritance with Overriding.	UAI	2001	DBLP BibTeX RDF
30	James D. Park, Adnan Darwiche	Approximating MAP using Local Search.	UAI	2001	DBLP BibTeX RDF
30	Salem Benferhat, Didier Dubois, Souhila Kaci, Henri Prade	Graphical readings of possibilistic logic bases.	UAI	2001	DBLP BibTeX RDF
30	Judea Pearl	Direct and Indirect Effects.	UAI	2001	DBLP BibTeX RDF
30	Craig Boutilier, Fahiem Bacchus, Ronen I. Brafman	UCP-Networks: A Directed Graphical Representation of Conditional Utilities.	UAI	2001	DBLP BibTeX RDF
30	Michael J. Kearns, Michael L. Littman, Satinder Singh 0001	Graphical Models for Game Theory.	UAI	2001	DBLP BibTeX RDF
30	Andrew Zimdars, David Maxwell Chickering, Christopher Meek	Using Temporal Data for Making Recommendations.	UAI	2001	DBLP BibTeX RDF
30	Rina Dechter, David Larkin 0001	Hybrid Processing of Beliefs and Constraints.	UAI	2001	DBLP BibTeX RDF
30	Joseph Y. Halpern, Judea Pearl	Causes and Explanations: A Structural-Model Approach: Part 1: Causes.	UAI	2001	DBLP BibTeX RDF
30	Milos Hauskrecht, Eli Upfal	A Clustering Approach to Solving Large Stochastic Matching Problems.	UAI	2001	DBLP BibTeX RDF
30	Avi Pfeffer	Sufficiency, Separability and Temporal Probabilistic Models.	UAI	2001	DBLP BibTeX RDF
30	Nicos Angelopoulos, James Cussens	Markov Chain Monte Carlo using Tree-Based Priors on Model Structure.	UAI	2001	DBLP BibTeX RDF