liu.seSearch for publications in DiVA
Change search
Refine search result
1 - 19 of 19
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1.
    Andersson Granberg, Tobias
    et al.
    Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, The Institute of Technology.
    Polishchuk, Valentin
    Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, The Institute of Technology.
    Socially optimal allocation of ATM resources via truthful market-based mechanisms2012In: Proceedings of the SESAR Innovation Days (2012) / [ed] Schaefer, Dirk, 2012Conference paper (Other academic)
  • 2.
    Arkin, Esther M
    et al.
    Department of Applied Mathematics and Statistics, Stony Brook University, USA .
    Dieckmann, Claudia
    Institute of Computer Science, Freie Universität Berlin, Germany .
    Knauer, Christian
    Institute of Computer Science, Universität Bayreuth, Germany .
    Mitchell, Joseph SB
    Department of Applied Mathematics and Statistics, Stony Brook University, USA .
    Polishchuk, Valentin
    Helsinki Institute for Information Technology, CS Dept, University of Helsinki, Finland .
    Schlipf, Lena
    Institute of Computer Science, Freie Universität Berlin, Germany .
    Yang, Shang
    Department of Computer Science, Stony Brook University, USA .
    Convex transversals2014In: Computational Geometry, ISSN 0925-7721, Vol. 47, no 2, p. 224-239Article in journal (Refereed)
    Abstract [en]

    We answer the question initially posed by Arik Tamir at the Fourth NYU Computational Geometry Day (March, 1987): “Given a collection of compact sets, can one decide in polynomial time whether there exists a convex body whose boundary intersects every set in the collection?”

    We prove that when the sets are segments in the plane, deciding existence of the convex stabber is NP-hard. The problem remains NP-hard if the sets are regular polygons. We also show that in 3D the stabbing problem is hard when the sets are balls. On the positive side, we give a polynomial-time algorithm to find a convex transversal of a maximum number of pairwise-disjoint segments in 2D if the vertices of the transversal are restricted to a given set of points. Our algorithm also finds a convex stabber of the maximum number of a set of convex pseudodisks in the plane.

    The stabbing problem is related to “convexity” of point sets measured as the minimum distance by which the points must be shifted in order to arrive in convex position; we give a PTAS to find the minimum shift in 2D, and a 2-approximation in any dimension. We also consider stabbing with vertices of a regular polygon – a problem closely related to approximate symmetry detection.

  • 3.
    Arkin, Esther M
    et al.
    Stony Brook University, USA,.
    Efrat, Alon
    Computer Science, the University of Arizona, USA,.
    Knauer, Christian
    Institute of Computer Science, Universitat Bayreuth, Germany,.
    Mitchell, Joseph SB
    Stony Brook University, USA,.
    Polishchuk, Valentin
    Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
    Rote, Günter
    Institute of Computer Science, Freie Universitat Berlin, Germany,.
    Schlipf, Lena
    Institute of Computer Science, Freie Universitat Berlin, Germany,.
    Talvitie, Topi
    Department of Computer Science, University of Finland.
    Shortest path to a segment and quickest visibility queries2016In: LIPIcs-Leibniz International Proceedings in Informatics, 2016, Vol. 7, p. 77-100Conference paper (Refereed)
    Abstract [en]

    We show how to preprocess a polygonal domain with a xed starting point s in order to answer eciently the following queries: Given a point q, how should one move from s in order to see q as soon as possible? This query resembles the well-known shortestpath- to-a-point query, except that the latter asks for the fastest way to reach q, instead of seeing it. Our solution methods include a data structure for a di erent generalization of shortest-path-to-a-point queries, which may be of independent interest: to report eciently a shortest path from s to a query segment in the domain.

  • 4.
    Bae, Sang Won
    et al.
    Kyonggi University, Suwon, South Korea.
    Korman, Matias
    Tohoku University, Sendai, Japan.
    Mitchell, Joseph SB
    Stony Brook University, New York, USA.
    Okamoto, Yoshio
    The University of Electro-Communications, Tokyo, Japan.
    Polishchuk, Valentin
    Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
    Wang, Haitao
    Utah State University, Utah, USA.
    Computing the $ L_1 $ Geodesic Diameter and Center of a Polygonal Domain2016In: Leibniz International Proceedings in Informatics, ISSN 1868-8969, E-ISSN 1868-8969, Vol. 47, p. 14:1-14:14Article in journal (Refereed)
    Abstract [en]

    For a polygonal domain with h holes and a total of n vertices, we present algorithms that compute the L1 geodesic diameter in O(n2+h4) time and the L1 geodesic center in O((n4+n2h4) (n)) time, where (·) denotes the inverse Ackermann function. No algorithms were known for these problems before. For the Euclidean counterpart, the best algorithms compute the geodesic diameter in O(n7.73) or O(n7(h+log n)) time, and compute the geodesic center in O(n12+) time. Therefore, our algorithms are much faster than the algorithms for the Euclidean problems. Our algorithms are based on several interesting observations on L1 shortest paths in polygonal domains.

  • 5.
    Bender, Michael A.
    et al.
    SUNY Stony Brook, NY USA.
    Fekete, Sandor P.
    TU Braunschweig, Germany.
    Kroeller, Alexander
    TU Braunschweig, Germany.
    Liberatore, Vincenzo
    Case Western Reserve University, OH 44106 USA.
    Mitchell, Joseph S. B.
    SUNY Stony Brook, NY USA.
    Polishchuk, Valentin
    Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
    Suomela, Jukka
    University of Helsinki, Finland; Aalto University, Finland.
    The minimum backlog problem2015In: Theoretical Computer Science, ISSN 0304-3975, E-ISSN 1879-2294, Vol. 605, p. 51-61Article in journal (Refereed)
    Abstract [en]

    We study the minimum backlog problem (MBP). This online problem arises, e.g., in the context of sensor networks. We focus on two main variants of MBP. The discrete MBP is a 2-person game played on a graph G = (V, E). The player is initially located at a vertex of the graph. In each time step, the adversary pours a total of one unit of water into cups that are located on the vertices of the graph, arbitrarily distributing the water among the cups. The player then moves from her current vertex to an adjacent vertex and empties the cup at that vertex. The players objective is to minimize the backlog, i.e., the maximum amount of water in any cup at any time. The geometric MBP is a continuous-time version of the MBP: the cups are points in the two-dimensional plane, the adversary pours water continuously at a constant rate, and the player moves in the plane with unit speed. Again, the players objective is to minimize the backlog. We show that the competitive ratio of any algorithm for the MBP has a lower bound of Omega (D), where D is the diameter of the graph (for the discrete MBP) or the diameter of the point set (for the geometric MBP). Therefore we focus on determining a strategy for the player that guarantees a uniform upper bound on the absolute value of the backlog. For the absolute value of the backlog there is a trivial lower bound of Omega (D), and the deamortization analysis of Dietz and Sleator gives an upper bound of O (D log N) for N cups. Our main result is a tight upper bound for the geometric MBP: we show that there is a strategy for the player that guarantees a backlog of O(D), independently of the number of cups. We also study a localized version of the discrete MBP: the adversary has a location within the graph and must act locally (filling cups) with respect to his position, just as the player acts locally (emptying cups) with respect to her position. We prove that deciding the value of this game is PSPACE-hard. (C) 2015 Elsevier B.V. All rights reserved.

  • 6.
    Bulusu, Vishwanath
    et al.
    University of California, Berkeley, USA.
    Polishchuk, Valentin
    Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
    Sengupta, Raja
    University of California, Berkeley, USA.
    Sedov, Leonid
    Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
    Capacity estimation for low altitude airspace2017In: 17th AIAA Aviation Technology, Integration, and Operations Conference, AIAA Association , 2017, p. 1-15Conference paper (Refereed)
  • 7.
    Efrat, Alon
    et al.
    University of Arizona, AZ 85721 USA.
    Fekete, Sandor P.
    Braunschweig University of Technology, Germany; TU Braunschweig, Germany.
    Mitchell, Joseph S. B.
    SUNY Stony Brook, NY 11794 USA.
    Polishchuk, Valentin
    Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
    Suomela, Jukka
    Aalto University, Finland.
    Improved Approximation Algorithms for Relay Placement2016In: ACM Transactions on Algorithms, ISSN 1549-6325, E-ISSN 1549-6333, Vol. 12, no 2, p. 20-Article in journal (Refereed)
    Abstract [en]

    In the relay placement problem, the input is a set of sensors and a number r >= 1, the communication range of a relay. In the one-tier version of the problem, the objective is to place a minimum number of relays so that between every pair of sensors there is a path through sensors and/or relays such that the consecutive vertices of the path are within distance r if both vertices are relays and within distance 1 otherwise. The two-tier version adds the restrictions that the path must go through relays, and not through sensors. We present a 3.11-approximation algorithm for the one-tier version and a polynomial-time approximation scheme (PTAS) for the two-tier version. We also show that the one-tier version admits no PTAS, assuming P not equal NP.

  • 8.
    Eriksson-Bique, Sylvester
    et al.
    Courant Institute NYU.
    Polishchuk, Valentin
    Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
    Sysikaski, Mikko
    Google, Inc. Zurich.
    Optimal Geometric Flows via Dual Programs2014In: Annual Symposium on Computational Geometry, 2014, p. 100-109Conference paper (Refereed)
    Abstract [en]

    Considering potentials in the dual of a planar network has proved to be a powerful tool for computing planar maximum flows. In this paper we explore the use of potentials for giving algorithmic and combinatorial results on continuous flows in geometric domains -- a (far going) generalization of discrete flows in unit-capacity planar networks.

    A continuous flow in a polygonal domain is a divergence-free vector field whose magnitude at every point is bounded by a given constant -- the domain's permeability. The flow enters the domain through a source edge on the outer boundary of the domain, and leaves through a sink edge on the boundary. The value of the flow is the total flow amount that comes in through the source (the same amount comes out of the sink, due to the vanishing divergence). The cost of the flow is the total length of its streamlines. The flow is called monotone if its streamlines are x-monotone curves.

    Our main result is an algorithm to find (an arbitrarily close approximation to) the minimum-cost monotone flow in a polygonal domain, by formulating the problem as a convex program with an interesting choice of variables: one variable per hole in the domain. Our approach is based on the following flow of ideas: flow is the gradient of a potential function; a potential function can be extended from free space to holes so that it is constant over each hole; instead of the potential function (a value per point in the domain) we can thus speak of a potential vector (a value per hole); a potential uniquely (up to homotopic equivalence) defines "thick" paths in the domain; the paths define a flow. We show that the flow cost is convex in the potential; this allows us to employ the ellipsoid method to find the mincost flow, using holes potentials as variables. At each ellipsoid iteration the separation oracle is implemented by feasibility checks in the "critical graph" of the domain -- as we prove, the graph defines linear constraints on the potentials.

    Using potentials and critical graphs we also prove MaxFlow/MinCut theorems for geometric flows -- both for monotone and for general ones. Formulating and proving the monotone version is a new result. The MaxFlow/MinCut theorem for non-monotone flows has been proved earlier by two different methods; the potentials technique provides a third proof.

  • 9.
    Golovin, Daniel
    et al.
    Google, Pittsburgh, PA, USA .
    Goyal, Vineet
    Department of Industrial Engineering and Operations Research, Columbia University, Upper Manhattan, NY, USA .
    Polishchuk, Valentin
    Department of Computer Science, Helsinki Institute for Information Technology, University of Helsinki, Helsinki, Finland .
    Ravi, R
    Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA, USA .
    Sysikaski, Mikko
    Google, Zurich, Switzerland .
    Improved approximations for two-stage min-cut and shortest path problems under uncertainty2015In: Mathematical Programming, ISSN 0025-5610, Vol. 149, no 1, p. 167-194Article in journal (Refereed)
    Abstract [en]

    In this paper, we study the robust and stochastic versions of the two-stage min-cut and shortest path problems introduced in Dhamdhere et al. (in How to pay, come what may: approximation algorithms for demand-robust covering problems. In: FOCS, pp 367–378, 2005), and give approximation algorithms with improved approximation factors. Specifically, we give a 2-approximation for the robust min-cut problem and a 4-approximation for the stochastic version. For the two-stage shortest path problem, we give a 3.39'>3.39 3.39 -approximation for the robust version and 6.78'>6.78 6.78 -approximation for the stochastic version. Our results significantly improve the previous best approximation factors for the problems. In particular, we provide the first constant-factor approximation for the stochastic min-cut problem. Our algorithms are based on a guess and prune strategy that crucially exploits the nature of the robust and stochastic objective. In particular, we guess the worst-case second stage cost and based on the guess, select a subset of costly scenarios for the first-stage solution to address. The second-stage solution for any scenario is simply the min-cut (or shortest path) problem in the residual graph. The key contribution is to show that there is a near-optimal first-stage solution that completely satisfies the subset of costly scenarios that are selected by our procedure. While the guess and prune strategy is not directly applicable for the stochastic versions, we show that using a novel LP formulation, we can adapt a guess and prune algorithm for the stochastic versions. Our algorithms based on the guess and prune strategy provide insights about the applicability of this approach for more general robust and stochastic versions of combinatorial problems.

  • 10.
    Hershberger, John
    et al.
    Mentor Graphics Corporation.
    Polishchuk, Valentin
    Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
    Speckmann, Bettina
    Dep. Mathematics and Computer Science TU Eindhoven.
    Talvitie, Topi
    Helsinki Institute for IT, CS Dept University of Helsinki.
    Geometric kth shortest paths: The applet2014In: Proceedings of the thirtieth annual symposium on Computational geometry, 2014Conference paper (Refereed)
    Abstract [en]

    Computing shortest paths in a polygonal do- main is a classic problem in computational geometry. Ecient algorithms for computing such paths use the continuous Dijk- stra paradigm [2], which not only allows one to nd the short- est path between two points but also computes the \shortest path map" from a given source|a structure enabling ecient queries of shortest paths to points in the domain.

  • 11.
    Kostitsyna, Irina
    et al.
    Eindhoven University of Technology, Netherlands.
    Loffler, Maarten
    University of Utrecht, Netherlands.
    Polishchuk, Valentin
    Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
    Optimizing airspace closure with respect to politicians egos2015In: Theoretical Computer Science, ISSN 0304-3975, E-ISSN 1879-2294, Vol. 586, p. 161-175Article in journal (Refereed)
    Abstract [en]

    When a president is landing at a busy airport, the airspace around the airport closes for commercial traffic. We show how to schedule the presidential squadron so as to minimize its impact on scheduled civilian flights; to obtain an efficient solution we use a "rainbow" algorithm recoloring aircraft on the fly as they are stored in a special type of forest. We also give a data structure to answer the following query efficiently: Given the presidents ego (the requested duration of airspace closure), when would be the optimal time to close the airspace? Finally, we study the dual problem: Given the time when the airspace closure must start, what is the longest ego that can be tolerated without sacrificing the general traffic? We solve the problem by drawing a Christmas tree in a delay diagram; the tree allows one to solve also the query version of the problem. (C) 2015 Elsevier B.V. All rights reserved.

  • 12.
    Kostitsyna, Irina
    et al.
    TU Eindhoven, Netherlands.
    Noellenburg, Martin
    TU Wien, Austria.
    Polishchuk, Valentin
    Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
    Schulz, Andre
    Fernuniv, Germany.
    Strash, Darren
    Karlsruhe Institute Technology, Germany.
    On Minimizing Crossings in Storyline Visualizations2015In: GRAPH DRAWING AND NETWORK VISUALIZATION, GD 2015, SPRINGER INT PUBLISHING AG , 2015, Vol. 9411, p. 192-198Conference paper (Refereed)
    Abstract [en]

    In a storyline visualization, we visualize a collection of interacting characters (e. g., in a movie, play, etc.) by x-monotone curves that converge for each interaction, and diverge otherwise. Given a storyline with n characters, we show tight lower and upper bounds on the number of crossings required in any storyline visualization for a restricted case. In particular, we show that if (1) each meeting consists of exactly two characters and (2) the meetings can be modeled as a tree, then we can always find a storyline visualization with O(n log n) crossings. Furthermore, we show that there exist storylines in this restricted case that require Omega(n log n) crossings. Lastly, we show that, in the general case, minimizing the number of crossings in a storyline visualization is fixedparameter tractable, when parameterized on the number of characters k. Our algorithm runs in time O(k!(2) k log k+ k!(2) m), where m is the number of meetings.

  • 13.
    Mitchell, Joseph S. B.
    et al.
    Stony Brook University, USA.
    Polishchuk, Valentin
    Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, The Institute of Technology. University of Helsinki, Finland.
    Sysikaski, Mikko
    University of Helsinki, Finland .
    Minimum-link paths revisited2014In: Computational geometry, ISSN 0925-7721, E-ISSN 1879-081X, Vol. 47, no 6, p. 651-667Article in journal (Refereed)
    Abstract [en]

    A path or a polygonal domain is C-oriented if the orientations of its edges belong to a set of C given orientations; this is a generalization of the notable rectilinear case (C = 2). We study exact and approximation algorithms for minimum-link C-oriented paths and paths with unrestricted orientations, both in C-oriented and in general domains. Our two main algorithms are as follows: A subquadratic-time algorithm with a non-trivial approximation guarantee for general (unrestricted-orientation) minimum-link paths in general domains. An algorithm to find a minimum-link C-oriented path in a C-oriented domain. Our algorithm is simpler and more time-space efficient than the prior algorithm. We also obtain several related results: 3SUM-hardness of determining the link distance with unrestricted orientations (even in a rectilinear domain). An optimal algorithm for finding a minimum-link rectilinear path in a rectilinear domain. The algorithm and its analysis are simpler than the existing ones. An extension of our methods to find a C-oriented minimum-link path in a general (not necessarily C-oriented) domain. A more efficient algorithm to compute a 2-approximate C-oriented minimum-link path. A notion of "robust" paths. We show how minimum-link C-oriented paths approximate the robust paths with unrestricted orientations to within an additive error of 1.

  • 14.
    Mitchell, Joseph S. B.
    et al.
    SUNY Stony Brook, NY 11794 USA.
    Polishchuk, Valentin
    Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
    Sysikaski, Mikko
    Google, Switzerland.
    Wang, Haitao
    Utah State University, UT 84322 USA.
    An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains2015In: Automata, Languages, and Programming, Pt I, SPRINGER-VERLAG BERLIN , 2015, Vol. 9134, p. 947-959Conference paper (Refereed)
    Abstract [en]

    We present a new algorithm for finding minimum-link rectilinear paths among h rectilinear obstacles with a total of n vertices in the plane. After the plane is triangulated, for any point s, our algorithm builds an O(n)-size data structure in O(n+h log h) time, such that given any query point t, we can compute a minimum-link rectilinear path from s to t in O(log n + k) time, where k is the number of edges of the path, and the query time is O(log n) if we only want to know the value k. The previously best algorithm solves the problem in O(n log n) time.

  • 15.
    Nikkila, Mikko
    et al.
    University of Helsinki, Finland .
    Polishchuk, Valentin
    Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, The Institute of Technology.
    Krasnoshchekov, Dmitry
    Institute Dynam Geospheres, Russia .
    Robust estimation of seismic coda shape2014In: Geophysical Journal International, ISSN 0956-540X, E-ISSN 1365-246X, Vol. 197, no 1, p. 557-565Article in journal (Refereed)
    Abstract [en]

    We present a new method for estimation of seismic coda shape. It falls into the same class of methods as non-parametric shape reconstruction with the use of neural network techniques where data are split into a training and validation data sets. We particularly pursue the well-known problem of image reconstruction formulated in this case as shape isolation in the presence of a broadly defined noise. This combined approach is enabled by the intrinsic feature of seismogram which can be divided objectively into a pre-signal seismic noise with lack of the target shape, and the remainder that contains scattered waveforms compounding the coda shape. In short, we separately apply shape restoration procedure to pre-signal seismic noise and the event record, which provides successful delineation of the coda shape in the form of a smooth almost non-oscillating function of time. The new algorithm uses a recently developed generalization of classical computational-geometry tool of alpha-shape. The generalization essentially yields robust shape estimation by ignoring locally a number of points treated as extreme values, noise or non-relevant data. Our algorithm is conceptually simple and enables the desired or pre-determined level of shape detail, constrainable by an arbitrary data fit criteria. The proposed tool for coda shape delineation provides an alternative to moving averaging and/or other smoothing techniques frequently used for this purpose. The new algorithm is illustrated with an application to the problem of estimating the coda duration after a local event. The obtained relation coefficient between coda duration and epicentral distance is consistent with the earlier findings in the region of interest.

  • 16.
    Nikolaevskiy, Ilya
    et al.
    Aalto University, Finland.
    Lukyanenko, Andrey
    Aalto University, Finland.
    Polishchuk, Tatiana
    Linköping University, Department of Computer and Information Science, Database and information techniques. Linköping University, Faculty of Science & Engineering.
    Polishchuk, Valentin
    Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
    Gurtov, Andrei
    Aalto University, Finland; Helsinki Institute Informat Technology, Finland; ITMO University, Russia.
    isBF: Scalable in-packet bloom filter based multicast2015In: Computer Communications, ISSN 0140-3664, E-ISSN 1873-703X, Vol. 70, p. 79-85Article in journal (Refereed)
    Abstract [en]

    Bloom filter (BF) based forwarding was proposed recently in several protocol alternatives to IP multicast. Some of these protocols avoid the state in intermediate routers and leave the burden of scalability management to the multicast source and end-hosts. Still, the existing BF-based protocols have scalability limitations and require explicit network management as well as non-trivial functionality from the network components. In this work we address the scalability limitations of the BF-based forwarding protocols by partitioning endhosts into clusters. We propose several algorithms to do the partitioning so as to decrease the overall traffic in the network. We evaluate our algorithms in a real Internet topology, demonstrating the ability of the proposed design to save up to 70% of traffic volume in the large-scale topology for big groups of subscribers, and up to 30% for small groups. (C) 2015 Elsevier B.V. All rights reserved.

  • 17.
    Packer, Eli
    et al.
    IBM Research Haifa Lab.
    Bak, Peter
    IBM Research Haifa Lab.
    Nikkila, Mikko
    University of Helsinki, Finland.
    Polishchuk, Valentin
    University of Helsinki, Finland.
    Ship, Harold J
    IBM Research Haifa Lab.
    Visual Analytics for Spatial Clustering: Using a Heuristic Approach for Guided Exploration2013In: Visualization and Computer Graphics, IEEE Transactions on, ISSN 1077-2626, Vol. 19, no 12, p. 2179-2188Article in journal (Refereed)
    Abstract [en]

    We propose a novel approach of distance-based spatial clustering and contribute a heuristic computation of input parameters for guiding users in the search of interesting cluster constellations. We thereby combine computational geometry with interactive visualization into one coherent framework. Our approach entails displaying the results of the heuristics to users, as shown in Figure 1, providing a setting from which to start the exploration and data analysis. Addition interaction capabilities are available containing visual feedback for exploring further clustering options and is able to cope with noise in the data. We evaluate, and show the benefits of our approach on a sophisticated artificial dataset and demonstrate its usefulness on real-world data.

  • 18.
    Sankararaman, Swaminathan
    et al.
    The University of Arizona, USA.
    Abu-Affash, Karim
    Ben Gurion University, Israel.
    Efrat, Alon
    The University of Arizona, USA.
    Eriksson-Bique, Sylvester David
    University of Helsinki, Helsinki, Finland.
    Polishchuk, Valentin
    University of Helsinki, Helsinki, Finland.
    Ramasubramanian, Srinivasan
    The University of Arizona, USA.
    Segal, Michael
    Ben Gurion University, Israel.
    Optimization schemes for protective jamming2014In: Mobile Networks and Applications, ISSN 1383-469X, Vol. 19, no 1, p. 45-60Article in journal (Refereed)
    Abstract [en]

    In this paper, we study strategies for allocating and managing friendly jammers, so as to create virtual barriers that would prevent hostile eavesdroppers from tapping sensitive wireless communication. Our scheme precludes the use of any encryption technique. Applications include domains such as (i) protecting the privacy of storage locations where RFID tags are used for item identication, (ii) secure reading of RFID tags embedded in credit cards, (iii) protecting data transmitted through wireless networks, sensor networks, etc. By carefully managing jammers to produce noise, we show how to reduce the SINR of eavesdroppers to below a threshold for successful reception, without jeopardizing network performance. We present algorithms targeted towards optimizing power allocation and number of jammers needed in several settings. Experimental simulations back up our results.

  • 19.
    Sedov, Leonid
    et al.
    Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
    Polishchuk, Valentin
    Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
    Josefsson, Billy
    Luftfartsverket, Sweden.
    Towards Simplified Optimal Sector Splitting2017In: Proceedings of the SESAR Innovation Days 2017: Selected scientific papers on air traffic management / [ed] Schaefer, Dirk, SESAR joint undertaking , 2017, p. 84-95Conference paper (Refereed)
1 - 19 of 19
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf