Efficient scaling of dynamic graph neural networks | 1 | 0.35 | 2021 |
PoWER-BERT - Accelerating BERT Inference via Progressive Word-vector Elimination. | 0 | 0.34 | 2020 |
Scheduling split intervals with non-uniform demands | 0 | 0.34 | 2020 |
On optimizing distributed non-negative Tucker decomposition | 1 | 0.36 | 2019 |
High-performance dense tucker decomposition on GPU clusters. | 4 | 0.40 | 2018 |
Set Cover Problems with Small Neighborhood Covers. | 0 | 0.34 | 2018 |
On Optimizing Distributed Tucker Decomposition for Sparse Tensors. | 3 | 0.37 | 2018 |
Improved Distributed Algorithm for Graph Truss Decomposition. | 0 | 0.34 | 2018 |
On Optimizing Distributed Tucker Decomposition For Dense Tensors | 3 | 0.38 | 2017 |
Replica Placement on Bounded Treewidth Graphs. | 0 | 0.34 | 2017 |
Subgraph Counting: Color Coding Beyond Trees | 7 | 0.44 | 2016 |
Fast Algorithms for Constrained Graph Density Problems. | 0 | 0.34 | 2015 |
Analysis of sampling algorithms for twitter | 0 | 0.34 | 2015 |
Replica Placement on Directed Acyclic Graphs. | 1 | 0.37 | 2014 |
Improved Algorithms for Resource Allocation under Varying Capacity. | 2 | 0.38 | 2014 |
Scalable Single Source Shortest Path Algorithms for Massively Parallel Systems | 13 | 0.55 | 2014 |
Distributed Algorithms for Scheduling on Line and Tree Networks with Non-uniform Bandwidths | 1 | 0.35 | 2013 |
Replica Placement via Capacitated Vertex Cover. | 2 | 0.41 | 2013 |
Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood Covers. | 1 | 0.37 | 2013 |
Knapsack Cover Subject to a Matroid Constraint. | 2 | 0.40 | 2013 |
Scheduling jobs with multiple non-uniform tasks | 3 | 0.40 | 2013 |
Distributed algorithms for scheduling on line and tree networks | 2 | 0.37 | 2012 |
Scheduling Resources for Executing a Partial Set of Jobs | 1 | 0.35 | 2012 |
Density Functions subject to a Co-Matroid Constraint | 1 | 0.39 | 2012 |
Mapping Strategies for the PERCS Architecture | 3 | 0.42 | 2012 |
Scheduling resources for throughput maximization | 0 | 0.34 | 2011 |
Minimum Cost Resource Allocation for Meeting Job Requirements | 7 | 0.56 | 2011 |
Maximizing throughput of jobs with multiple resource requirements | 0 | 0.34 | 2011 |
Improved Algorithms for the Distributed Trigger Counting Problem | 5 | 0.48 | 2011 |
Resource allocation for covering time varying demands | 8 | 0.59 | 2011 |
Decision trees for entity identification: Approximation algorithms and hardness results | 35 | 1.81 | 2011 |
An efficient decentralized algorithm for the distributed trigger counting problem | 3 | 0.42 | 2011 |
Finding Independent Sets in Unions of Perfect Graphs | 0 | 0.34 | 2010 |
A Near-linear Time Constant Factor Algorithm for Unsplittable Flow Problem on Line with Bag Constraints | 4 | 0.43 | 2010 |
Varying bandwidth resource allocation problem with bag constraints | 15 | 0.80 | 2010 |
Brief announcement: a decentralized algorithm for distributed trigger counting | 4 | 0.47 | 2010 |
On the Complexity of the $k$-Anonymization Problem | 4 | 0.43 | 2010 |
Keyword Search over Dynamic Categorized Information | 4 | 0.55 | 2009 |
Context Oriented Information Integration | 0 | 0.34 | 2009 |
Approximating maximum weight K-colorable subgraphs in chordal graphs | 3 | 0.41 | 2009 |
SMS based interface for FAQ retrieval | 31 | 1.75 | 2009 |
Approximating Decision Trees with Multiway Branches | 11 | 0.72 | 2009 |
Analysis of sampling techniques for association rule mining | 24 | 0.85 | 2009 |
Efficient techniques for document sanitization | 20 | 0.89 | 2008 |
Finding Irrefutable Certificates for S2p via Arthur and Merlin | 4 | 0.40 | 2008 |
Oblivious Symmetric Alternation | 9 | 0.46 | 2006 |
Time-Space Tradeoff in Derandomizing Probabilistic Logspace | 5 | 0.54 | 2006 |
Efficiently linking text documents with relevant structured information | 47 | 2.14 | 2006 |
On zero error algorithms having oracle access to one query | 3 | 0.38 | 2006 |
Synopses for query optimization: a space-complexity perspective | 6 | 0.41 | 2005 |