Search Results - "Konjevod, Goran"

Refine Results
  1. 1

    Robust optimization of contaminant sensor placement for community water systems by Carr, Robert D., Greenberg, Harvey J., Hart, William E., Konjevod, Goran, Lauer, Erik, Lin, Henry, Morrison, Tod, Phillips, Cynthia A.

    Published in Mathematical programming (01-06-2006)
    “…We present a series of related robust optimization models for placing sensors in municipal water networks to detect contaminants that are maliciously or…”
    Get full text
    Journal Article
  2. 2

    A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem by Garg, Naveen, Konjevod, Goran, Ravi, R.

    Published in Journal of algorithms (01-10-2000)
    “…Given a weighted graph with some subsets of vertices called groups, the group Steiner tree problem is to find a minimum-weight subgraph which contains at least…”
    Get full text
    Journal Article Conference Proceeding
  3. 3

    Origami based Mechanical Metamaterials by Lv, Cheng, Krishnaraju, Deepakshyam, Konjevod, Goran, Yu, Hongyu, Jiang, Hanqing

    Published in Scientific reports (07-08-2014)
    “…We describe mechanical metamaterials created by folding flat sheets in the tradition of origami, the art of paper folding and study them in terms of their…”
    Get full text
    Journal Article
  4. 4

    Improved approximations for tour and tree covers by KÖNEMANN, Jochen, KONJEVOD, Goran, PAREKH, Ojas, SINHA, Amitabh

    Published in Algorithmica (01-03-2004)
    “…A tree (tour) cover of an edge-weighted graph is a set of edges which forms a tree (closed walk) and covers every other edge in the graph. Arkin et al. give…”
    Get full text
    Conference Proceeding Journal Article
  5. 5

    Randomized post-optimization of covering arrays by Nayeri, Peyman, Colbourn, Charles J., Konjevod, Goran

    Published in European journal of combinatorics (01-01-2013)
    “…The construction of covering arrays with the fewest rows remains a challenging problem. Most computational and recursive constructions result in extensive…”
    Get full text
    Journal Article
  6. 6

    Context‐aided analysis of community evolution in networks by Pallotta, Giuliana, Konjevod, Goran, Cadena, Jose, Nguyen, Phan

    Published in Statistical analysis and data mining (01-10-2017)
    “…We are interested in detecting and analyzing global changes in dynamic networks (networks that evolve with time). More precisely, we consider changes in the…”
    Get full text
    Journal Article
  7. 7

    Linear-programming-based techniques for synthesis of network-on-chip architectures by Srinivasan, K., Chatha, K.S., Konjevod, G.

    “…Application-specific system-on-chip (SoC) design offers the opportunity for incorporating custom network-on-chip (NoC) architectures that are more suitable for…”
    Get full text
    Journal Article
  8. 8

    Coloring number and on-line Ramsey theory for graphs and hypergraphs by Kierstead, H. A., Konjevod, Goran

    Published in Combinatorica (Budapest. 1981) (2009)
    “…Let c,s,t be positive integers. The ( c,s,t )- Ramsey game is played by Builder and Painter. Play begins with an s -uniform hypergraph G 0 =( V,E 0 ), where E…”
    Get full text
    Journal Article
  9. 9

    Effective storage capacity of labeled graphs by Angluin, Dana, Aspnes, James, Bazzi, Rida A., Chen, Jiang, Eisenstat, David, Konjevod, Goran

    Published in Information and computation (01-02-2014)
    “…We consider the question of how much information can be stored by labeling the vertices of a connected undirected graph G using a constant-size set of labels,…”
    Get full text
    Journal Article
  10. 10

    Dude (Duality descriptor): A robust descriptor for disparate images using line segment duality by Kwon, Youngwook P., Hyojin Kim, Konjevod, Goran, McMains, Sara

    “…We present a novel descriptor algorithm (DUDE) using line/point duality and a randomization strategy that provides simple but robust, consistent feature…”
    Get full text
    Conference Proceeding
  11. 11

    Adaptive Decentralized Routing in Small-World Networks by Bakun, Oleg, Konjevod, Goran

    “…We study routing in a small-world network modeled by an augmented grid, where Kleinberg's expected polylog bound offers a theoretical explanation for the…”
    Get full text
    Conference Proceeding
  12. 12

    Deep Multi-modal Vehicle Detection in Aerial ISR Imagery by Sakla, Wesam, Konjevod, Goran, Mundhenk, T. Nathan

    “…Since the introduction of deep convolutional neural networks (CNNs), object detection in imagery has witnessed substantial breakthroughs in state-of-the-art…”
    Get full text
    Conference Proceeding
  13. 13

    Automated Techniques for Synthesis of Application-Specific Network-on-Chip Architectures by Chatha, K.S., Srinivasan, K., Konjevod, G.

    “…This paper addresses the automated synthesis of a custom network-on-chip architecture whose topology is optimized for the specific communication requirements…”
    Get full text
    Journal Article
  14. 14
  15. 15

    On the establishment of distinct identities in overlay networks by Bazzi, Rida A., Konjevod, Goran

    Published in Distributed computing (01-03-2007)
    “…We study ways to restrict or prevent the damage that can be caused in a peer-to-peer network by corrupt entities creating multiple pseudonyms. We show that it…”
    Get full text
    Journal Article
  16. 16

    Novel Adversarial Defense Techniques for White-Box Attacks by Van Tuinen, Jason, Ranganath, Aditya, Konjevod, Goran, Singhal, Mukesh, Marcia, Roummel

    “…In this paper, we propose a novel machine learning technique to detect and correctly classify adversarially modified images. Our approach takes advantage of…”
    Get full text
    Conference Proceeding
  17. 17
  18. 18

    On approximating planar metrics by tree metrics by Konjevod, Goran, Ravi, R., Salman, F.Sibel

    Published in Information processing letters (30-11-2001)
    “…We combine the results of Bartal [Proc. 37th FOCS, 1996, pp. 184–193] on probabilistic approximation of metric spaces by tree metrics, with those of Klein,…”
    Get full text
    Journal Article
  19. 19

    Approximation algorithms for power minimization of earliest deadline first and rate monotonic schedules by Sushu Zhang, Chatha, K S, Konjevod, G

    “…We address power minimization of earliest deadline first and rate monotonic schedules by voltage and frequency scaling. We prove that the problems are NP-hard,…”
    Get full text
    Conference Proceeding
  20. 20