A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
On the Hardness of Recognizing Bundles in Time Table Graphs
[chapter]
1999
Lecture Notes in Computer Science
Preserved Fulltext
Ø Ò Ø Ø Ñ × Ó ÖÖ Ú Ð Ò Ô ÖØÙÖ ÓÖ ×ØÓÔº ËÙ × Ø Ó ØÖ Ò Ø Ñ Ø Ð × Ò Ù × Ö Ø Ø Ñ Ø Ð Ö Ô × ÓÐÐÓÛ× ØÖ Ò ×Ø Ø ÓÒ ÔÔ Ö Ò Ò ×ÓÑ Ø Ñ Ø Ð ÓÑ × Ú ÖØ Ü Ó Ø Ö Ô ¸ Ò Ø Ö × ØÖ Ò Ð Ú Ò ×Ø Ø ÓÒ Ö Ò Ú Ò ×Ø Ø ÓÒ × × Ø× Ò ...
Òݸ
ÒÒ Ö ØºÄ
Ö× ÙÒ ¹ ÓÒ×Ø ÒÞº
Ò
ÇÊÇÌÀ
Ï AE Ê
ÍÒ Ú Ö× ØÝ Ó ÃÓÒ×Ø ÒÞ¸
ÙÐØÝ Ó Å Ø
Ñ Ø × Ò
ÓÑÔÙØ Ö Ë Ò ¸
½
¸
¹
ÃÓÒ×Ø ÒÞ¸
ÖÑ Òݸ
ÓÖÓØ
ºÏ
Ò Ö ÙÒ ¹ ÓÒ×Ø ÒÞº
Ò
à ÊËÌ AE Ï ÁÀ
ÍÒ Ú Ö ...
doi:10.1007/3-540-46784-x_31
fatcat:k3dsf4bdebcbhj2ceslbq5g2de
Page 6805 of Mathematical Reviews Vol. , Issue 2001I
[page]
2001
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.
6805
20011:90105 90C35 0SC85 68R10
Liebers, Annegret (D-K NST-CS; Konstanz);
Wagner, Dorothea (D-K NST-CS; Konstanz);
Weihe, Karsten (D-K NST-CS; Konstanz)
On the hardness of recognizing bundles in time ...
table graphs. ...
(p,k)-coloring problems in line graphs
2005
Theoretical 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 2019; you can also visit the original URL.
The file type is application/pdf.
Finally, upper bounds on the optimal values are derived in general graphs by sequential algorithms based on Welsh-Powell and Matula orderings. ...
We also give complexity results for the problem of finding a maximum (p, k)-colorable subgraph in line graphs. ...
As a consequence of some of these results, for a perfect graph G and for p and k fixed, one can recognize in polynomial time whether G ∈ K p S k . ...
doi:10.1016/j.tcs.2005.09.037
fatcat:g3m73yhowvfitanbixycfflkla
Performance Metrics of Wormhole Detection using Path Tracing Algorithm
2015
Indian Journal of Science and Technology
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 2018; you can also visit the original URL.
The file type is application/pdf.
Methods: We propose path tracing algorithm for detection of worm hole attack as a extension of aodv protocols the path of the node effectively computes the per hop distance of its neighbor node with per ...
The main aim of the paper is to protect the network from worm hole attack using path tracing algorithm with the advancement of aodv and compare the performance parameters. ...
Every Hop Distance Estimation The vicinity of wormhole can be recognized by computing the separation between each one bounce in a way We consider Round Excursion Time (RTT) worth to figure the every jump ...
doi:10.17485/ijst/2015/v8i17/63541
fatcat:v4drxyuxgre2hinlybs5zcaxey
AUTOMATIC ORIENTATION OF IMAGE SEQUENCES IN CULTURAL HERITAGE
2012
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information 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.
recognize a large amount of homologous points on a set of images in a completely automatic way. ...
The modeling and the three-dimensional reconstruction of objects, structures or sites of interest assume an important role in the field of cultural heritage. ...
The large number of points extracted by the SIFT operator, can produce a huge number of tie-points on the images; such circumstance could make hard the bundle block adjustment process. ...
doi:10.5194/isprsarchives-xxxviii-5-w16-293-2011
fatcat:wtej6f2mcbe5hjbr26ev6f3q4a
Number Recognition from Captured Images
2016
International Journal of Computer Applications
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 2018; you can also visit the original URL.
The file type is application/pdf.
This system captures images of the tables in which marks are written by the teacher in the students" answer book, recognize the numbers or marks from it and fill the same in appropriate database on the ...
This is very time consuming and tedious job. In this paper an attempt is made to automatically recognize numbers in the document by capturing images of that document. ...
But if the data is available in the form of hard copy or handwritten form then it is very time consuming and tedious job to convert the data available in hard format to soft format. ...
doi:10.5120/ijca2016910660
fatcat:lyfemebbwvbujlsbqlfkelzn6a
CUBu: Universal Real-Time Bundling for Large Graphs
2016
IEEE Transactions on Visualization and Computer Graphics
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.
Fully GPU-based, CUBu bundles graphs of up to a million edges at interactive framerates, being over 50 times faster than comparable state-of-the-art methods, and has a simple and intuitive control of bundling ...
We present CUBu, a framework that addresses the above problems in an integrated way. ...
TABLE 2 Timings for CUBu and KDEEB [22] for several graphs (Sec. 5.2). ...
doi:10.1109/tvcg.2016.2515611
pmid:26761819
fatcat:tbxvcltypfgzzk6vdphlwzccae
A Survey on Graph Drawing Beyond Planarity
[article]
2018
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 2019; you can also visit the original URL.
The file type is application/pdf.
Aim of this survey is to describe the main research directions in this area, the most prominent known results, and some of the most challenging open problems. ...
Graph Drawing Beyond Planarity is a rapidly growing research area that classifies and studies geometric representations of non-planar graphs in terms of forbidden crossing configurations. ...
Recognizing straight-line RAC drawable graphs is NP-hard in general [23] , while it can be solved in linear time for complete bipartite graphs [106] . ...
arXiv:1804.07257v1
fatcat:xeckxilhfbbgdbfhctikymlq6m
Vanity fair
2008
Proceeding of the 17th ACM conference on Information and knowledge mining - CIKM '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.
Second, we demonstrate analytical vulnerabilities based on the ability to separate the queries in a bundle into threads corresponding to individual users. ...
We show that these propensities interact badly with two forms of vulnerabilities in the bundling scheme. ...
As shown in Table 6 , about 3% of the bundles have a user that issued at least half of the queries in the bundle. ...
doi:10.1145/1458082.1458195
dblp:conf/cikm/JonesKPT08
fatcat:ie3ozrnchbgvrdrnlwvwyqhpui
Native Build System for Unity Builds with Sophisticated Bundle Strategies
2021
IEICE transactions on information and 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 2021; you can also visit the original URL.
The file type is application/pdf.
However, the longer build times of recent large C++ projects have imposed a requirement on build systems: i.e., unity builds. ...
To accomplish this goal, our build system uses sophisticated bundle strategies developed on the basis of hints extracted from the preprocessed code of each source file. ...
Acknowledgments This work was supported in part by Japan Science and Technology Agency (JST CREST JPMJCR19F3). ...
doi:10.1587/transinf.2020edp7105
fatcat:3ubbtsuvqve5dfhhl4psvjnx3q
1-Fan-bundle-planar drawings of graphs
2018
Theoretical 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 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2017 pre-print arXiv:1702.06163v3 fatcat:nnu57ptwrzacnaffhse3ncxr7eOther Versions
In particular, we restrict the bundling to the end segments of the edges. Similarly to 1-planarity, we call our model 1-fan-bundle-planarity, as we allow at most one crossing per bundle. ...
To enable the comparison with other established near-planarity models in graph drawing, we formulate a new edge-bundling model which is inspired by the recently introduced fan-planar graphs. ...
We glue the baby snakes together at their cutvertices. By Lemma 11, we only have to check whether the legs are big, which can be done in linear time. ...
doi:10.1016/j.tcs.2018.03.005
fatcat:z3ccdacm2vcrrdyvjk4jbhahyy
Page 2090 of Mathematical Reviews Vol. , Issue 2002C
[page]
2002
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.
Kanj and Weijia Jia, Vertex cover: further observations and further improvements (313-324); Annegret Liebers, Dorothea Wagner and Karsten Weihe, On the hardness of recognizing bundles in time table graphs ...
Benno Stein and Oliver Niggemann, On the nature of structure and its identification (122-134); Martin Charles Golumbic and Udi Rotics, On the clique-width of perfect graph classes (extended abstract) ( ...
An Introduction to Error Detection and Correction
2017
IOSR Journal of Computer 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 2018; you can also visit the original URL.
The file type is application/pdf.
In this paper all components are contemplated and best system on the premise of exactness, manysided quality and power utilization is chosen. ...
There ought to be exchange off between many-sided quality of equipment and power utilization in decoder. ...
By taking a gander at the move of move registers ( Table 1 and Table 2 , the state graph is made as appeared in Figure 2 . ...
doi:10.9790/0661-1902052027
fatcat:bksiqmw7jngerole2i3crzllqy
The Money Pump as a Measure of Revealed Preference Violations: A Comment
2013
Journal of Political Economy
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.
In words, GARP states that it cannot be that bundle q i is preferred over bundle q j and that at the same time bundle q i costs at prices p j strictly less than bundle q j . ...
It can be easily checked that the graph representation of D − has the same set of arcs as the original graph G. It follows that both have the same number of cycles. ...
Let us write M P I(C) for the value of the MPI corresponding to a cycle C in the graph representation of the dataset S. ...
doi:10.1086/674077
fatcat:ivbr3tjut5dlrgqinkr6giunc4
Data Structures for the Cloud and External Memory Data (Dagstuhl Seminar 19051)
2019
Dagstuhl Reports
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 2022; you can also visit the original URL.
The file type is application/pdf.
In spite of the maturity of the field many data structuring problems are still open, while new ones arise due to technological advances. ...
The manner in which information is stored profoundly influences the efficiency of these operations over the data. ...
In our work, we prove the NP-hardness of recognizing Wheeler graphs, in addition to providing an exponential time algorithm for the recognition problem which has better time complexity than the naive approach ...
doi:10.4230/dagrep.9.1.104
dblp:journals/dagstuhl-reports/BrodalMNS19
fatcat:rkthfdy3k5cxzaxiwuwbojd2ha
« Previous
Showing results 1 — 15 out of 11,108 results