Deep Multi-Modal Vehicle Detection In Aerial Isr Imagery | 3 | 0.39 | 2017 |
Context-aided analysis of community evolution in networks. | 0 | 0.34 | 2017 |
A Large Contextual Dataset For Classification, Detection And Counting Of Cars With Deep Learning | 26 | 1.20 | 2016 |
Scale-Free Compact Routing Schemes in Networks of Low Doubling Dimension. | 0 | 0.34 | 2016 |
Effective storage capacity of labeled graphs. | 0 | 0.34 | 2014 |
Randomized post-optimization of covering arrays | 16 | 1.03 | 2013 |
Randomized compact routing in decomposable metrics | 0 | 0.34 | 2011 |
Detecting sybil nodes in static and dynamic networks | 0 | 0.34 | 2010 |
Storage Capacity of Labeled Graphs | 0 | 0.34 | 2010 |
Randomized Postoptimization of Covering Arrays | 10 | 0.66 | 2009 |
Compacting cuts: A new linear formulation for minimum cut | 4 | 0.54 | 2009 |
Coloring number and on-line Ramsey theory for graphs and hypergraphs | 11 | 0.79 | 2009 |
Near optimal battery-aware energy management | 0 | 0.34 | 2009 |
Engineering Label-Constrained Shortest-Path Algorithms | 14 | 0.87 | 2008 |
Dynamic routing and location services in metrics of low doubling dimension | 10 | 0.55 | 2008 |
Optimal scale-free compact routing schemes in networks of low doubling dimension | 15 | 0.65 | 2007 |
On the establishment of distinct identities in overlay networks | 43 | 2.60 | 2007 |
Approximation algorithms for power minimization of earliest deadline first and rate monotonic schedules | 18 | 0.71 | 2007 |
Application Specific Network-on-Chip Design with Guaranteed Quality Approximation Algorithms | 17 | 0.93 | 2007 |
Combinational equivalence checking for threshold logic circuits | 14 | 0.87 | 2007 |
Compact routing with slack in low doubling dimension | 13 | 0.55 | 2007 |
Optimal-stretch name-independent compact routing in doubling metrics | 25 | 0.87 | 2006 |
Simulating impact of light rail on urban growth in Phoenix: an application of urbansim modeling environment | 1 | 0.38 | 2006 |
Robust optimization of contaminant sensor placement for community water systems | 15 | 1.96 | 2006 |
On sampling in higher-dimensional peer-to-peer systems | 1 | 0.36 | 2006 |
Linear Programming based Techniques for Synthesis of Network-on-Chip Architectures | 159 | 6.50 | 2006 |
A tight lower bound for the steiner point removal problem on trees | 7 | 0.58 | 2006 |
A modular algorithm-theoretic framework for the fair and efficient collaborative prefetching of continuous media. | 3 | 0.42 | 2005 |
Improved approximations for tour and tree covers | 12 | 0.77 | 2004 |
Budget constrained minimum cost connected medians | 1 | 0.40 | 2004 |
A theoretical study of optimization techniques used in registration area based location management: models and online algorithms | 1 | 0.35 | 2002 |
Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router | 19 | 1.57 | 2002 |
Approximation algorithms for the covering Steiner problem | 17 | 1.31 | 2002 |
Finding Most Sustainable Paths in Networks with Time-Dependent Edge Reliabilities | 1 | 0.37 | 2002 |
A 2\frac{1}{10}-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem | 22 | 1.77 | 2001 |
On approximating planar metrics by tree metrics | 16 | 4.23 | 2001 |
On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem | 24 | 1.27 | 2001 |
A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem | 14 | 1.25 | 2000 |
On the red-blue set cover problem | 75 | 3.37 | 2000 |
Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems | 26 | 3.73 | 2000 |
Algorithms for optimizing production DNA sequencing | 4 | 0.74 | 2000 |
A polylogarithmic approximation algorithm for the group Steiner tree problem | 122 | 10.89 | 1998 |