A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
Filters
Minimum Cost Topology Construction for Rural Wireless Mesh Networks
2008
2008 Proceedings IEEE INFOCOM - The 27th Conference on Computer Communications
Preserved Fulltext
The dominant cost of constructing such a mesh network is the cost of constructing antenna towers at nodes. ...
We show that this problem is NPhard and that a better than O(log n) approximation cannot be expected, where n is the number of vertices in the graph. ...
The instance of the TC problem that we construct from this instance of the set cover problem has the following characteristics: (1) The undirected graph G = (V, E) is the incidence graph of C with some ...
doi:10.1109/infocom.2007.128
fatcat:kmiaqtx7a5djxldvil6ki4eppy
Minimum Cost Topology Construction for Rural Wireless Mesh Networks
2008
IEEE INFOCOM 2008 - The 27th Conference on Computer Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
The dominant cost of constructing such a mesh network is the cost of constructing antenna towers at nodes. ...
We show that this problem is NPhard and that a better than O(log n) approximation cannot be expected, where n is the number of vertices in the graph. ...
The instance of the TC problem that we construct from this instance of the set cover problem has the following characteristics: (1) The undirected graph G = (V, E) is the incidence graph of C with some ...
doi:10.1109/infocom.2008.128
dblp:conf/infocom/PanigrahiDJNR08
fatcat:gysziiilkbgilfvza65h4kfaoa
On incremental maintenance of 2-hop labeling of graphs
2008
Proceeding of the 17th international conference on World Wide Web - WWW '08
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The proposed 2-hop labeling is derived from graph connectivities, as opposed to SET COVER which is used by all previous work. ...
In response to these, this paper studies the incremental maintenance of 2-hop labeling. We identify the main reason for the inefficiency of updates of existing 2-hop labels. ...
We are grateful to Jiefeng Cheng for the implementation of 2-hop labelings [21, 7] used in [4] . We thank anonymous referees for their invaluable comments. ...
doi:10.1145/1367497.1367611
dblp:conf/www/BramandiaCN08
fatcat:3dr2z5bmbrfqhaoisgd6psxu4y
Incremental Problems in the Parameterized Complexity Setting
2016
Theory of Computing Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Interestingly, some incremental versions of hard problems become tractable, while others remain hard. ...
Moreover tractability or intractability is not a simple function of the problem's static complexity, every level of the W-hierarchy exhibits complete problems with both tractable and intractable incrementalizations ...
We construct an instance (G , k ) of c-ADD-APPROX-INDUCED r -DEGENERATE SUB-GRAPH by taking G as c + 1 disjoint copies of G and setting k = k(c + 1). ...
doi:10.1007/s00224-016-9729-6
fatcat:b475qneyefhofdwjvn7tdbqqji
Efficient Maintenance of Distance Labelling for Incremental Updates in Large Dynamic Graphs
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose an online incremental method to efficiently answer distance queries over very large dynamic graphs. ...
A tremendous amount of research has been successfully attempted on this problem, most of which is limited to static graphs. ...
A minimal highway cover labelling can be efficiently constructed, independently of the order of applying landmarks [10] . ...
arXiv:2102.08529v1
fatcat:cmeuof63t5a6bnqatcbtsyy2mm
Analysis and evaluation of address arithmetic capabilities in custom DSP architectures
1997
Proceedings of the 34th annual conference on Design automation conference - DAC '97
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
Subsuming address arithmetic into auto-increment/decrement arithmetic improves both the performance and size of the generated code. ...
We present two sets of experimental results based on selected benchmark programs: (1) the values of l and k beyond which there is little or no improvement in performance, and (2) the values of l and kwhich ...
We then describe the process of constructing an access graph for a procedure.
A. ...
doi:10.1145/266021.266103
dblp:conf/dac/SudarsanamLD97
fatcat:jc6zlidfxba3jdsjpl53b5ghmm
Improving Offset Assignment on Embedded Processors Using Transformations
[chapter]
2000
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
It finds a layout of variables in RAM, so that it is possible to subsume explicit address register manipulation instructions into other instructions as a post-increment or post-decrement operation. ...
Experimental results show the effectiveness of our solution. ...
Acknowledgments The work of J. Ramanujam is supported in part by an NSF grant CCR-0073800 and by NSF Young Investigator Award CCR-9457768. ...
doi:10.1007/3-540-44467-x_33
fatcat:cbalp6a6yfbjppriuele2hw7ha
Improving Offset Assignment for Embedded Processors
[chapter]
2001
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
It finds a layout of variables in RAM, so that it is possible to subsume explicit address register manipulation instructions into other instructions as a post-increment or post-decrement operation. ...
Experimental results show the effectiveness of our solution. ...
Acknowledgments The work of J. Ramanujam is supported in part by an NSF grant CCR-0073800 and by NSF Young Investigator Award CCR-9457768. ...
doi:10.1007/3-540-45574-4_11
fatcat:yzu36p7j5fc4xczxhlnioeisxe
Guest Editor's Foreword
2009
Discrete & Computational Geometry
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Mulzer revisit the popular randomized incremental constructions (RICs). ...
family of convex sets, extracting a covering sub-family of minimal size is a classical NP-hard problem. ...
doi:10.1007/s00454-009-9168-0
fatcat:msdfbdjalvazzns7rkmlmx42bm
Gateways Placement in Backbone Wireless Mesh Networks
2009
International Journal of Communications, Network and System Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Experimental results show that its performance is as good as that of the best of existing algorithms for the gateway placement problem. ...
Finally, we conclude the incremental clustering algorithm. 46 M. TANG ET AL. ...
Algorithm 1 Incremental clustering algorithm while U ≠ φ do construct a BWMN graph from U; build the R-step transitive closure from the BWMN graph; identify gateways from the R-step transitive closure; ...
doi:10.4236/ijcns.2009.21005
fatcat:k2c2lgwt2vhjjfhiaw4bbv5kki
An Approach to Incremental Deep Web Crawling Based on Incremental Harvest Model
2012
Procedia Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The goal of incremental deep web crawling is to select the appropriate query to obtain the incremental records as many as possible while minimizing the communication cost. ...
In the approach, a set covering model is used to indicate the web database; based on this model, an incremental harvest model is learned by the machine learning method to select the appropriate query automatically ...
[3] proposes a new graph model, and then the incremental deep web crawling task is transformed into a graph traversal process. ...
doi:10.1016/j.proeng.2012.01.093
fatcat:feedixbfejfczm72mrngs6spma
Automatic detection of recurring operation patterns
1999
Proceedings of the seventh international workshop on Hardware/software codesign - CODES '99
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We describe the application of a new pattern matching technique to the problem of the identification of recurring patterns of operations. ...
This paper addresses the question of how to find specialized ISA extensions for a set of applications. ...
Incremental Matching Given a subject graph G,,b and a library of pattern meets certain matching criteria, which we will not go into here, apartzal match is created. ...
doi:10.1145/301177.301192
dblp:conf/codes/ArnoldC99
fatcat:xcgrazuyezfllmhk3hposqb3bm
Page 7814 of Mathematical Reviews Vol. , Issue 97M
[page]
1997
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
An intersection graph of circles is called a unit disk graph. ...
It is based on identifying sequences of coverings of [0,1]¢. Each covering A% consists of sets C;, with diameter bounded by the diameter D(A, ) of the covering. ...
Variable radii connected sensor cover in sensor networks
2009
ACM transactions on sensor networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
Such a set of active sensors is known as a connected sensor cover, and the problem of selecting a minimum connected sensor cover has been well studied when the transmission radius and sensing radius of ...
The set of active sensors should also form a connected communication graph, so that they can autonomously respond to application queries and/or tasks. ...
phase, we construct a Steiner tree to connect the sensor cover constructed in the first phase. ...
doi:10.1145/1464420.1464428
fatcat:pqqdukd6ofgejpeqrz2aoywucq
On the Power of Tree-Depth for Fully Polynomial FPT Algorithms
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
m) time or O(td· (m+n n)) time, where td is the tree-depth of the input graph. ...
In this paper, we investigate the complexity of graph problems in P parameterized by tree-depth, a graph parameter related to tree-width. ...
Given a non-negative edge-weighted directed graph and its elimination forest of depth k, we can construct a 2-hop cover of maximum label size 2k in O(k(m + n log n)) time. ...
arXiv:1710.04376v2
fatcat:l7bcdthq2zg4phw5mjcxwo2ata
« Previous
Showing results 1 — 15 out of 110,445 results