|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 28 occurrences of 27 keywords
|
|
|
Results
Found 58 publication records. Showing 58 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
36 | T. Yung Kong |
The Khalimsky topologies are precisely those simply connected topologies on Zn whose connected sets include all 2n-connected sets but no (3n-1)-disconnected sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 305(1-3), pp. 221-235, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
29 | Michel Habib, Christophe Paul, Mathieu Raffinot |
Maximal Common Connected Sets of Interval Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 15th Annual Symposium, CPM 2004, Istanbul,Turkey, July 5-7, 2004, Proceedings, pp. 359-372, 2004, Springer, 3-540-22341-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
24 | Matthias Ruhl, Hannes Hartenstein, Dietmar Saupe |
Adaptive Partitionings for Fractal Image Compression. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP (2) ![In: Proceedings 1997 International Conference on Image Processing, ICIP '97, Santa Barbara, California, USA, October 26-29, 1997, pp. 310-313, 1997, IEEE Computer Society, 0-8186-8183-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
adaptive partitionings, fractal image compression, split-and-merge process, connected sets, small square image blocks, rate-distortion curves, encoding quality, evolutionary computing, data compression, time-complexity, ranges, acceleration techniques |
24 | Sean McGuinness |
Colouring Arcwise Connected Sets in the Plane II. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 17(1), pp. 135-148, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
23 | Attila Kuba |
Reconstruction in Different Classes of 2D Discrete Sets (Invited Paper). ![Search on Bibsonomy](Pics/bibsonomy.png) |
DGCI ![In: Discrete Geometry for Computer Imagery, 8th International Conference, DCGI'99, Marne-la-Vallee, France, March 17-19, 1999, Proceedings, pp. 153-163, 1999, Springer, 3-540-65685-5. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
19 | Alberto Pastrana Palma, J. Andrew Bangham |
Correspondence Regions and Structured Images. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MICAI ![In: MICAI 2007: Advances in Artificial Intelligence, 6th Mexican International Conference on Artificial Intelligence, Aguascalientes, Mexico, November 4-10, 2007, Proceedings, pp. 580-589, 2007, Springer, 978-3-540-76630-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Correspondance points, stable regions, sieve algorithm, connected-sets |
19 | Andrew Vince |
Counting connected sets and connected partitions of a graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Australas. J Comb. ![In: Australas. J Comb. 67, pp. 281-293, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
18 | Péter Balázs, Emese Balogh, Attila Kuba |
A Fast Algorithm for Reconstructing hv-Convex 8-Connected but Not 4-Connected Discrete Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DGCI ![In: Discrete Geometry for Computer Imagery, 11th International Conference, DGCI 2003, Naples, Italy, November 19-21, 2003, Proceedings, pp. 388-397, 2003, Springer, 3-540-20499-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
convex and connected discrete set, reconstruction, Discrete tomography |
15 | Evangelos Kranakis, Danny Krizanc, Berthold Ruf, Jorge Urrutia, Gerhard J. Woeginger |
VC-Dimensions for Graphs (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 21st International Workshop, WG '95, Aachen, Germany, June 20-22, 1995, Proceedings, pp. 1-13, 1995, Springer, 3-540-60618-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
14 | Nilanjan Ray, Scott T. Acton |
Inclusion filters: a class of self-dual connected operators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Image Process. ![In: IEEE Trans. Image Process. 14(11), pp. 1736-1746, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
13 | Jacob E. Goodman |
Double-permutation sequences and pseudoline transversals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 159, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
double-permutation sequence, pseudoline, convex set, transversal |
12 | Wenhao Wu |
A Connected Sets Detection Morphological Filter for Airborne LiDAR DTM Extraction under Urban Area. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCCS ![In: 8th International Conference on Computer and Communication Systems, ICCCS 2023, Guangzhou, China, April 21-23, 2023, pp. 469-474, 2023, IEEE, 978-1-6654-5612-8. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | Ivan Bliznets, Danil Sagunov, Eugene Tagin |
Enumeration of Minimal Tropical Connected Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity - 13th International Conference, CIAC 2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings, pp. 127-141, 2023, Springer, 978-3-031-30447-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
12 | J. Pascal Gollin, Karl Heuer |
Characterising k-connected sets in infinite graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 157, pp. 451-499, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Peter Frankl, János Pach |
On Well-Connected Sets of Strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 29(1), 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Daniel McGinnis, Shira Zerbib |
Line Transversals in Families of Connected Sets in the Plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 36(4), pp. 2916-2919, December 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | John Haslegrave |
The number and average size of connected sets in graphs with degree constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 100(3), pp. 530-542, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
12 | Kustaa Kangas, Petteri Kaski, Janne H. Korhonen, Mikko Koivisto |
On the Number of Connected Sets in Bounded Degree Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 25(4), pp. 4, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
12 | Mauro Bonafini, Giandomenico Orlandi, Édouard Oudet |
Variational Approximation of Functionals Defined on 1-dimensional Connected Sets: The Planar Case. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Math. Anal. ![In: SIAM J. Math. Anal. 50(6), pp. 6307-6332, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
12 | Mathieu Chapelle, Manfred Cochefert, Dieter Kratsch, Romain Letourneur, Mathieu Liedloff |
Exact exponential algorithms to find tropical connected sets of minimum size. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 676, pp. 33-41, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
12 | Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi |
Enumerating Minimal Tropical Connected Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2017: Theory and Practice of Computer Science - 43rd International Conference on Current Trends in Theory and Practice of Computer Science, Limerick, Ireland, January 16-20, 2017, Proceedings, pp. 217-228, 2017, Springer, 978-3-319-51962-3. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
12 | Matthieu Bonnivard, Antoine Lemenant, Filippo Santambrogio |
Approximation of Length Minimization Problems Among Compact Connected Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Math. Anal. ![In: SIAM J. Math. Anal. 47(2), pp. 1489-1529, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
12 | Ulrich W. Kulisch |
Up-to-date Interval Arithmetic: From Closed Intervals to Connected Sets of Real Numbers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPAM (2) ![In: Parallel Processing and Applied Mathematics - 11th International Conference, PPAM 2015, Krakow, Poland, September 6-9, 2015. Revised Selected Papers, Part II, pp. 413-434, 2015, Springer, 978-3-319-32151-6. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
12 | Michal Lason, Piotr Micek, Arkadiusz Pawlik, Bartosz Walczak |
Coloring Intersection Graphs of Arc-Connected Sets in the Plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 52(2), pp. 399-415, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
12 | Kustaa Kangas, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen |
On the Number of Connected Sets in Bounded Degree Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers, pp. 336-347, 2014, Springer, 978-3-319-12339-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
12 | Michal Lason, Piotr Micek, Arkadiusz Pawlik, Bartosz Walczak |
Coloring intersection graphs of arc-connected sets in the plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1310.7558, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
12 | Sh. Najafzadeh, Ali Ebadian |
Convex family of meromorphically multivalent functions on connected sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. Model. ![In: Math. Comput. Model. 57(3-4), pp. 301-305, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
12 | Lawrence H. Erickson, Steven M. LaValle |
Navigation among visually connected sets of partially distinguishable landmarks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICRA ![In: IEEE International Conference on Robotics and Automation, ICRA 2012, 14-18 May, 2012, St. Paul, Minnesota, USA, pp. 4829-4835, 2012, IEEE, 978-1-4673-1403-9. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
12 | Enrico Miglierina, Elena Molho |
Sectionwise connected sets in vector optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Lett. ![In: Oper. Res. Lett. 37(4), pp. 295-298, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
12 | Evelyn Magazanik, Micha A. Perles |
Staircase Connected Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 37(4), pp. 587-599, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
12 | Fabien Coulon, Mathieu Raffinot |
Fast algorithms for identifying maximal common connected sets of interval graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 154(12), pp. 1709-1721, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
12 | Azriel Rosenfeld, Akira Nakamura |
Two simply connected sets that have the same area are IP-equivalent. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Pattern Recognit. ![In: Pattern Recognit. 35(2), pp. 537-541, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
12 | Alexander A. Sapozhenko |
On the number of connected sets with the neighborhood of a given size in a graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 114(1-3), pp. 233-247, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
12 | Sean McGuinness |
Colouring Arcwise Connected Sets in the Plane I. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 16(4), pp. 429-439, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
12 | Reinhard Diestel, Tommy R. Jensen, Konstantin Yu. Gorbunov, Carsten Thomassen |
Highly Connected Sets and the Excluded Grid Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 75(1), pp. 61-73, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
12 | Martin Ester, Hans-Peter Kriegel, Jörg Sander 0001, Xiaowei Xu 0001 |
Density-Connected Sets and their Application for Trend Detection in Spatial Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD ![In: Proceedings of the Third International Conference on Knowledge Discovery and Data Mining (KDD-97), Newport Beach, California, USA, August 14-17, 1997, pp. 10-15, 1997, AAAI Press, 1-57735-027-8. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP BibTeX RDF |
|
12 | Jan Kratochvíl |
Intersection Graphs of Noncrossing Arc-Connected Sets in the Plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, Symposium on Graph Drawing, GD '96, Berkeley, California, USA, September 18-20, Proceedings, pp. 257-270, 1996, Springer, 3-540-62495-3. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
12 | Jacek Marciniec |
Connected Sets of Types and Categorial Consequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LACL ![In: Logical Aspects of Computational Linguistics, First International Conference, LACL '96, Nancy, France, September 23-25, 1996, Selected Papers, pp. 292-309, 1996, Springer, 3-540-63700-1. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
12 | James G. Oxley |
On Hartfiel and Maxson's definition of connected sets of a matroid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 28(2), pp. 249-250, 1980. The full citation details ...](Pics/full.jpeg) |
1980 |
DBLP DOI BibTeX RDF |
|
12 | Darald J. Hartfiel, Carlton J. Maxson |
On a definition of connected sets of a matroid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 25(2), pp. 130-134, 1978. The full citation details ...](Pics/full.jpeg) |
1978 |
DBLP DOI BibTeX RDF |
|
12 | Preston C. Hammer, Richard M. Jones |
Connected Sets: Bases and Metrics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Syst. Theory ![In: Math. Syst. Theory 5(3), pp. 282-288, 1971. The full citation details ...](Pics/full.jpeg) |
1971 |
DBLP DOI BibTeX RDF |
|
12 | Ralph McKenzie, Jan Mycielski, David Thompson |
On Boolean Functions and Connected Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Syst. Theory ![In: Math. Syst. Theory 5(3), pp. 259-270, 1971. The full citation details ...](Pics/full.jpeg) |
1971 |
DBLP DOI BibTeX RDF |
|
11 | Igor Ulitsky, Richard M. Karp, Ron Shamir |
Detecting Disease-Specific Dysregulated Pathways Via Analysis of Clinical Expression Profiles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RECOMB ![In: Research in Computational Molecular Biology, 12th Annual International Conference, RECOMB 2008, Singapore, March 30 - April 2, 2008. Proceedings, pp. 347-359, 2008, Springer, 978-3-540-78838-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
9 | Jacob E. Goodman, Richard Pollack |
The combinatorial encoding of disjoint convex sets in the plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 28(1), pp. 69-81, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 52A35, 52C30 |
8 | Eli Berger |
KKM-A Topological Approach For Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 25(1), pp. 1-18, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05B40 |
8 | Timothy J. Hickey, Qun Ju, Maarten H. van Emden |
Interval arithmetic: From principles to implementation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 48(5), pp. 1038-1068, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
8 | Peter Fritzson, Vadim Engelson |
Modelica - A Unified Object-Oriented Language for System Modelling and Simulation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECOOP ![In: ECOOP'98 - Object-Oriented Programming, 12th European Conference, Brussels, Belgium, July 20-24, 1998, Proceedings, pp. 67-90, 1998, Springer, 3-540-64737-6. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
8 | Yuri Boykov, Olga Veksler, Ramin Zabih |
Disparity Component Matching for Visual Correspondence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CVPR ![In: 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97), June 17-19, 1997, San Juan, Puerto Rico, pp. 470-475, 1997, IEEE Computer Society, 0-8186-7822-4. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
motion, Stereo, maximum likelihood, correspondence, connected components |
7 | Jeffrey Johnson 0001 |
Hypernetworks of Complex Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Complex (1) ![In: Complex Sciences, First International Conference, Complex 2009, Shanghai, China, February 23-25, 2009. Revised Papers, Part 1, pp. 364-375, 2009, Springer, 978-3-642-02465-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Hypernetworks, Backcloth, Multilevel Systems, Networks, Dynamics, Complex Systems, Traffic, Simplicial Complex, Simplex |
7 | Shi-Zhong Bai, Xiu-Yun Wu |
LaTex L-Fuzzy Strong Pre-connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSKD (1) ![In: Fifth International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2008, 18-20 October 2008, Jinan, Shandong, China, Proceedings, Volume 1, pp. 316-318, 2008, IEEE Computer Society, 978-0-7695-3305-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
5 | Iván Dotú, Pascal Van Hentenryck, Miguel A. Patricio, Antonio Berlanga, José García, José M. Molina López |
Real-Time Tabu Search for Video Tracking Association. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2009, 15th International Conference, CP 2009, Lisbon, Portugal, September 20-24, 2009, Proceedings, pp. 21-34, 2009, Springer, 978-3-642-04243-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
5 | Adrian Andronache, Patricia Ruiz, Steffen Rothkugel |
Improving Inter-cluster Broadcasting in Ad Hoc Networks by Delayed Flooding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MCO ![In: Modelling, Computation and Optimization in Information Systems and Management Sciences, Second International Conference, MCO 2008, Metz, France - Luxembourg, September 8-10, 2008. Proceedings, pp. 478-487, 2008, Springer, 978-3-540-87476-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
cluster, mobile, Networking, broadcast, delay, ad hoc, weighted, tolerant |
5 | Henrik Schulz 0001 |
Polyhedral Surface Approximation of Non-convex Voxel Sets through the Modification of Convex Hulls. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWCIA ![In: Combinatorial Image Analysis, 12th International Workshop, IWCIA 2008, Buffalo, NY, USA, April 7-9, 2008. Proceedings, pp. 38-50, 2008, Springer, 978-3-540-78274-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
5 | Adrian Ion, Walter G. Kropatsch, Eric Andres |
Euclidean Eccentricity Transform by Discrete Arc Paving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DGCI ![In: Discrete Geometry for Computer Imagery, 14th IAPR International Conference, DGCI 2008, Lyon, France, April 16-18, 2008. Proceedings, pp. 213-224, 2008, Springer, 978-3-540-79125-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
eccentricity transform, discrete analytical circles |
5 | Xiyu Liu 0001, Hong Liu 0013 |
Topological Cluster: A Generalized View for Density-based Spatial Clustering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSCWD ![In: Proceedings of the 11th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2007, April 26-28, 2007, Melbourne, Australia, pp. 7-12, 2007, IEEE. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
5 | Ana Maria Mendonça, Aurélio C. Campilho |
Segmentation of retinal blood vessels by combining the detection of centerlines and morphological reconstruction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Medical Imaging ![In: IEEE Trans. Medical Imaging 25(9), pp. 1200-1213, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
5 | Iwan Jensen |
Counting Polyominoes: A Parallel Implementation for Cluster Computing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science ![In: Computational Science - ICCS 2003, International Conference, Melbourne, Australia and St. Petersburg, Russia, June 2-4, 2003. Proceedings, Part III, pp. 203-212, 2003, Springer, 3-540-40196-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
5 | James J. Little |
Deforming Surface Features Lines in Intrinsic Coordinates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPR ![In: 15th International Conference on Pattern Recognition, ICPR'00, Barcelona, Spain, September 3-8, 2000., pp. 1291-1294, 2000, IEEE Computer Society, 0-7695-0750-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #58 of 58 (100 per page; Change: )
|
|