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.
Filters
Combinatorial network abstraction by trees and distances
2008
Theoretical Computer Science
Preserved Fulltext
This work draws attention to combinatorial network abstraction problems which are specified by a class P of pattern graphs and a real-valued similarity measure ̺ based on certain graph properties. ...
We consider this problem for the natural case of trees and distance-based similarity measures. ...
. ⊓ ⊔
Conclusion We have introduced the problem of combinatorial network abstraction and systematically studied it for the natural case of trees and distance-based similarity measures. ...
doi:10.1016/j.tcs.2008.03.037
fatcat:5hiv3j3dtjhc3cqsnfa7bpi43e
Combinatorial Network Abstraction by Trees and Distances
[chapter]
2005
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 2017; you can also visit the original URL.
The file type is application/pdf.
This work draws attention to combinatorial network abstraction problems which are specified by a class P of pattern graphs and a real-valued similarity measure ̺ based on certain graph properties. ...
We consider this problem for the natural case of trees and distance-based similarity measures. ...
. ⊓ ⊔
Conclusion We have introduced the problem of combinatorial network abstraction and systematically studied it for the natural case of trees and distance-based similarity measures. ...
doi:10.1007/11602613_109
fatcat:fwcv3uowxvbddpux53rm57pibq
Connectivity-based localization of large-scale sensor networks with complex shape
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 2015; you can also visit the original URL.
The file type is application/pdf.
Our algorithm first selects landmarks on network boundaries with sufficient density, then constructs the landmark Voronoi diagram and its dual combinatorial Delaunay complex on these landmarks. ...
The key insight is that the combinatorial Delaunay complex is provably globally rigid and has a unique realization in the plane. ...
This work is supported by NSF CAREER Award CNS-0643687. We thank Alexander Kröller, Joe Mitchell, Rik Sarkar, Xianjin Zhu for various discussions on this problem. ...
doi:10.1145/1614379.1614383
fatcat:zfyacz36bfdo5mxxore3wrcjhe
Connectivity-Based Localization of Large Scale Sensor Networks with Complex Shape
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 2015; you can also visit the original URL.
The file type is application/pdf.
Our algorithm first selects landmarks on network boundaries with sufficient density, then constructs the landmark Voronoi diagram and its dual combinatorial Delaunay complex on these landmarks. ...
The key insight is that the combinatorial Delaunay complex is provably globally rigid and has a unique realization in the plane. ...
This work is supported by NSF CAREER Award CNS-0643687. We thank Alexander Kröller, Joe Mitchell, Rik Sarkar, Xianjin Zhu for various discussions on this problem. ...
doi:10.1109/infocom.2008.130
dblp:conf/infocom/LedererWG08
fatcat:sc2sso5gsrdabo5zo6mwzsem4q
Connectivity-Based Localization of Large Scale Sensor Networks with Complex Shape
2008
2008 Proceedings IEEE INFOCOM - 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 2015; you can also visit the original URL.
The file type is application/pdf.
Our algorithm first selects landmarks on network boundaries with sufficient density, then constructs the landmark Voronoi diagram and its dual combinatorial Delaunay complex on these landmarks. ...
The key insight is that the combinatorial Delaunay complex is provably globally rigid and has a unique realization in the plane. ...
This work is supported by NSF CAREER Award CNS-0643687. We thank Alexander Kröller, Joe Mitchell, Rik Sarkar, Xianjin Zhu for various discussions on this problem. ...
doi:10.1109/infocom.2007.130
fatcat:olq37qovu5gylpqvslfqvuctmi
Object Spaces: An Organizing Strategy for Biological Theorizing
2009
Biological Theory
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.
Object spaces have three primary components: (1) a combinatorial biological process such as protein synthesis that generates objects with parts that are modular, independent, and organized according to ...
an invariant syntax; (2) a notion of "distance" that relates the objects according to rules of change over time as found in nature or useful for algorithms; (3) mapping functions defined on the space ...
Acknowledgments Many thanks to Bill Wimsatt, Matt Haber, Chris DiTeresi, Elihu Gerson, Julio Tuma, Erin Barringer, and the University of Chicago Philosophy of Biology and CHSS graduate workshops. ...
doi:10.1162/biot.2009.4.3.280
fatcat:7dptcckcw5cu7bmikpelqkwxma
Building a Coverage Hole-free Communication Tree
2018
Proceedings of the 14th ACM International Symposium on QoS and Security for Wireless and Mobile Networks - Q2SWinet'18
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.
In this paper we propose an algorithm that can build a communication tree between nodes of a wireless network with guarantee that there is no coverage hole in the tree. ...
We use simplicial homology to compute mathematically the coverage, and Prim's algorithm principle to build the communication tree. ...
To do that we compare the area covered before the algorithm runs with all vertices, and the area covered by only the tree vertices. ...
doi:10.1145/3267129.3267139
dblp:conf/mswim/VergneDM18
fatcat:nqexozcsmrhutphkbaiggmetme
Building a coverage hole-free communication tree
[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.
In this paper we propose an algorithm that can build a communication tree between nodes of a wireless network with guarantee that there is no coverage hole in the tree. ...
We use simplicial homology to compute mathematically the coverage, and Prim's algorithm principle to build the communication tree. ...
To do that we compare the area covered before the algorithm runs with all vertices, and the area covered by only the tree vertices. ...
arXiv:1802.08442v1
fatcat:3phdlhmamvce7kr7q5ns6ofxu4
Survivable Network Design with an Evolution Strategy
[chapter]
2008
Studies in Computational Intelligence
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.
It is based on a combinatorial variant of the evolution strategy and clearly outperforms existing benchmark results by genetic algorithms. ...
In this chapter, a novel evolutionary approach to survivable network design is presented when considering both economics and reliability. ...
[41] apply the evolution strategy to combinatorial tree problems by using a random key representation which represents trees with real numbers. ...
doi:10.1007/978-3-540-76286-7_12
fatcat:izl6zsf2gjdzlniv6hnwzkzqxi
The connectivity-profile of random increasing k-trees
[article]
2009
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Random increasing k-trees represent an interesting, useful class of strongly dependent graphs for which analytic-combinatorial tools can be successfully applied. ...
We study in this paper a notion called connectivity-profile and derive asymptotic estimates for it; some interesting consequences will also be given. ...
and the predictive power for practical-world complex networks. ...
arXiv:0910.3639v1
fatcat:33qzjv2okzefplmwtiggjswxx4
Page 7882 of Mathematical Reviews Vol. , Issue 99k
[page]
1999
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.
in virtual colonoscopy (289-298); Bang Ye Wu, Kun-Mao Chao and Chuan Yi Tang, Approximation and exact al- gorithms for constructing minimum ultrametric trees from distance matrices (299-308); H. ...
buses (229-240); Tsan-sheng Hsu and Dian Rae Lopez, Executing divisible jobs on a network with a fixed number of processors (extended abstract) (241-250); Bernard Mans, Francesco Pappalardi and Igor Shparlinski ...
Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks
2007
Electronical Notes in 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 2017; you can also visit the original URL.
The file type is application/pdf.
In this survey, we will make a special effort to abstract some combinatorial and algebraic properties, and some common data-structural tools that are at the base of those techniques. ...
This will help us try to present some of the newest results in a unifying framework so that they can be better understood and deployed also by non-specialists. ...
Throughout the paper, we have attempted to present all the algorithmic techniques within a unifying framework by abstracting the algebraic and combinatorial properties and the data-structural tools that ...
doi:10.1016/j.entcs.2006.11.006
fatcat:ss7kxtmk4fah5a5qmpxieln2be
Facial image retrieval, identification, and inference system
1993
Proceedings of the first ACM international conference on Multimedia - MULTIMEDIA '93
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.
The system stores and manages facial images and criminal records, providing necessary image and text processing, and editing tools. ...
It provides users with a flexible means to manipulate, archive, retrieve, and make use of facial images and text data. The facial images are visual rather than descriptive. ...
Acknowledgment The authors would like to thank Inspector Lau and Inspector Chan of the Criminal Identification Department, Dr. Rexon Ngim of Singapore General Hospital, and Dr. ...
doi:10.1145/166266.166271
dblp:conf/mm/WuALMN93
fatcat:4rcn7bmwlrhpzebfullsq6lfty
The connectivity-profile of random increasing k-trees
2010
2010 Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO)
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.
Random increasing k-trees represent an interesting, useful class of strongly dependent graphs for which analytic-combinatorial tools can be successfully applied. ...
We study in this paper a notion called connectivity-profile and derive asymptotic estimates for it; some interesting consequences will also be given. ...
and the predictive power for practical-world complex networks. ...
doi:10.1137/1.9781611973006.13
dblp:conf/analco/DarrasseHBS10
fatcat:7f7v67nqengulcom273oo4hfc4
A Survey of Combinatorial Methods for Phylogenetic Networks
2010
Genome Biology and Evolution
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.
The evolutionary history of a set of species is usually described by a rooted phylogenetic tree. ...
In this article, we give an introduction to the topic of phylogenetic networks, very briefly describing the fundamental concepts and summarizing some of the most important combinatorial methods that are ...
By definition, most (if not all) types of unrooted phylogenetic networks are abstract networks, as evolution is inherently rooted (and thus any unrooted phylogenetic tree is also abstract, in this sense ...
doi:10.1093/gbe/evq077
pmid:21081312
pmcid:PMC3017387
fatcat:gspgmsuxuvguhjqfxhsxcduqmm
« Previous
Showing results 1 — 15 out of 10,895 results