|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 258 occurrences of 163 keywords
|
|
|
Results
Found 734 publication records. Showing 683 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
123 | Pierre Fraigniaud, Amos Korman, Emmanuelle Lebhar |
Local MST computation with short advice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007, pp. 154-160, 2007, ACM, 978-1-59593-667-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
distributed algorithm, minimum spanning tree, local computation |
81 | Li-Jen Mao, Narsingh Deo, Sheau-Dong Lang |
A Parallel Algorithm for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 1999 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '99), 23-25 June 1999, Fremantle, Australia, pp. 184-189, 1999, IEEE Computer Society, 0-7695-0231-8. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Parallel approximate algorithm, degree-constrained MST, reciprocal nearest neighbors, minimum spanning tree |
69 | Fabio Belloni, Andreas Richter, Visa Koivunen |
DoA Estimation Via Manifold Separation for Arbitrary Array Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Signal Process. ![In: IEEE Trans. Signal Process. 55(10), pp. 4800-4810, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
69 | Seth Pettie |
An Inverse-Ackermann Type Lower Bound For Online Minimum Spanning Tree Verification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 26(2), pp. 207-230, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C38, 68W01, 68R10 |
69 | Michael Elkin |
A faster distributed protocol for constructing a minimum spanning tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pp. 359-368, 2004, SIAM, 0-89871-558-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
65 | Deyu Zhou, Yulan He 0001, Chee Keong Kwoh 0001, Hao Wang |
Ant-MST: An Ant-Based Minimum Spanning Tree for Gene Expression Data Clustering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PRIB ![In: Pattern Recognition in Bioinformatics, Second IAPR International Workshop, PRIB 2007, Singapore, October 1-2, 2007, Proceedings, pp. 198-205, 2007, Springer, 978-3-540-75285-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
ant-based clustering, clustering, minimum spanning tree, gene expression data |
58 | Hongju Cheng, Qin Liu 0003, Xiaohua Jia |
Heuristic algorithms for real-time data aggregation in wireless sensor networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWCMC ![In: Proceedings of the International Conference on Wireless Communications and Mobile Computing, IWCMC 2006, Vancouver, British Columbia, Canada, July 3-6, 2006, pp. 1123-1128, 2006, ACM, 1-59593-306-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
degree and hop constrained MST, sensor networks, real-time, data aggregation |
58 | Hongxu Cai, Yingchao Zhao 0001 |
On Approximation Ratios of Minimum-Energy Multicast Routing in Wireless Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 9(3), pp. 243-262, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
broadcasting, ad hoc wireless networks, MST |
58 | Yongwook Choi, Gopal Pandurangan, Maleq Khan, V. S. Anil Kumar 0001 |
Energy-Optimal Distributed Algorithms for Minimum Spanning Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE J. Sel. Areas Commun. ![In: IEEE J. Sel. Areas Commun. 27(7), pp. 1297-1304, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
58 | Maleq Khan, Gopal Pandurangan |
A fast distributed approximation algorithm for minimum spanning trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 20(6), pp. 391-402, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Randomized algorithm, Minimum spanning tree, Distributed approximation algorithm |
58 | Yongwook Choi, Maleq Khan, V. S. Anil Kumar 0001, Gopal Pandurangan |
Energy-optimal distributed algorithms for minimum spanning trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Munich, Germany, June 14-16, 2008, pp. 188-190, 2008, ACM, 978-1-59593-973-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
distributed algorithm, energy-efficient, minimum spanning tree, distributed approximation algorithm |
58 | Maleq Khan, Gopal Pandurangan |
A Fast Distributed Approximation Algorithm for Minimum Spanning Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 20th International Symposium, DISC 2006, Stockholm, Sweden, September 18-20, 2006, Proceedings, pp. 355-369, 2006, Springer, 3-540-44624-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Minimum Spanning Tree, Distributed Approximation Algorithm |
58 | Qing Dai, Jie Wu 0001 |
Computation of Minimal Uniform Transmission Range in Ad Hoc Wireless Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Clust. Comput. ![In: Clust. Comput. 8(2-3), pp. 127-133, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
power control, minimum spanning tree, ad hoc wireless network, graph connectivity, transmission power |
58 | Enrico Nardelli, Guido Proietti, Peter Widmayer |
Nearly Linear Time Minimum Spanning Tree Maintenance for Transient Node Failures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 40(2), pp. 119-132, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Transient node failures, Fault tolerance, Graph algorithms, Minimum spanning tree, Algorithmic mechanism design |
58 | Carsten Tzschoppe, Franz Rothlauf, Hans Josef Pesch |
The Edge-Set Encoding Revisited: On the Bias of a Direct Representation for Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO (2) ![In: Genetic and Evolutionary Computation - GECCO 2004, Genetic and Evolutionary Computation Conference, Seattle, WA, USA, June 26-30, 2004, Proceedings, Part II, pp. 258-270, 2004, Springer, 3-540-22343-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
58 | Aaron Archer, David P. Williamson |
Faster approximation algorithms for the minimum latency problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 12-14, 2003, Baltimore, Maryland, USA., pp. 88-96, 2003, ACM/SIAM, 0-89871-538-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP BibTeX RDF |
|
58 | Qing Dai, Jie Wu 0001 |
Computation of Minimal Uniform Transmission Power in Ad Hoc Wireless Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCS Workshops ![In: 23rd International Conference on Distributed Computing Systems Workshops (ICDCS 2003 Workshops), 19-22 May 2003, Providence, RI, USA, pp. 680-684, 2003, IEEE Computer Society, 0-7695-1921-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
power control, minimum spanning tree, ad hoc wireless network, graph connectivity, transmission power |
58 | Jan-Ming Ho, Gopalakrishnan Vijayan, C. K. Wong |
A New Approach to the Rectilinear Steiner Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 26th ACM/IEEE Design Automation Conference, Las Vegas, Nevada, USA, June 25-29, 1989., pp. 161-166, 1989, ACM Press. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
53 | Zvi Lotker, Boaz Patt-Shamir, David Peleg |
Distributed MST for constant diameter graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 18(6), pp. 453-460, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Minimum-weight spanning tree, Distributed algorithm |
53 | Zvi Lotker, Boaz Patt-Shamir, David Peleg |
Distributed MST for constant diameter graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, PODC 2001, Newport, Rhode Island, USA, August 26-29, 2001, pp. 63-71, 2001, ACM, 1-58113-383-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
53 | Jungho Park, Toshimitsu Masuzawa, Kenichi Hagihara, Nobuki Tokura |
Distributed Algorithms for Reconstructing MST after Topology Change. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WDAG ![In: Distributed Algorithms, 4th International Workshop, WDAG '90, Bari, Italy, September 24-26, 1990, Proceedings, pp. 122-132, 1990, Springer, 3-540-54099-7. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
53 | Mst. Rubina Aktar, Md. Shamim Anower, Md. Zahurul Islam Sarkar, Abu Sadat Md. Sayem, Md. Rashedul Islam, Allama Iqbal Akash, Mst. Rumana Akter Rume, Gholamhosein Moloudian, Ali Lalbakhsh |
Energy-Efficient Hybrid Powered Cloud Radio Access Network (C-RAN) for 5G. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 11, pp. 3208-3220, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
53 | Tahasin Ahmed Fahim, Mst Farzana Khatun, A. M. Mahfuz-Ur-Rahman, Md. Shamim Anower, Ajay Krishno Sarkar, Mahbubur Rahman, Mafin Muntasir Rahman, Fazlur Rashid, Mst Nahida Akter |
An embedded system for observing the stages of lung cancer in non-invasive way. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GCCE ![In: IEEE 6th Global Conference on Consumer Electronics, GCCE 2017, Nagoya, Japan, October 24-27, 2017, pp. 1-2, 2017, IEEE, 978-1-5090-4045-2. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
47 | Ying Li, Junjie Li, Huilong Duan, Xudong Lu |
Structuralization of Digestive Endoscopic Report Based on NLP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BMEI (1) ![In: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics, BMEI 2008, May 28-30, 2008, Sanya, Hainan, China - Volume 1, pp. 920-923, 2008, IEEE Computer Society, 978-0-7695-3118-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
NLP, Structuralization, MST |
47 | Jiaxiang Lin, Dongyi Ye, Chongcheng Chen, Miaoxian Gao |
Minimum Spanning Tree Based Spatial Outlier Mining and Its Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RSKT ![In: Rough Sets and Knowledge Technology, Third International Conference, RSKT 2008, Chengdu, China, May 17-19, 2008. Proceedings, pp. 508-515, 2008, Springer, 978-3-540-79720-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Spatial outliers, MST Clustering, D-TIN, Outlier mining |
47 | Hasan Arslan, Shantanu Dutt |
An effective hop-based detailed router for FPGAs for optimizing track usage and circuit performance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Great Lakes Symposium on VLSI ![In: Proceedings of the 14th ACM Great Lakes Symposium on VLSI 2004, Boston, MA, USA, April 26-28, 2004, pp. 208-213, 2004, ACM, 1-58113-853-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
bump and refit paradigm, bumping cost, hop-based routing, switchbox, FPGAs, detailed routing, MST |
46 | Qing Wang 0018, Huiyou Chang |
Multitasking bar: prototype and evaluation of introducing the task concept into a browser. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CHI ![In: Proceedings of the 28th International Conference on Human Factors in Computing Systems, CHI 2010, Atlanta, Georgia, USA, April 10-15, 2010, pp. 103-112, 2010, ACM, 978-1-60558-929-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
multiple sessions task, tasks, browser, multitasking, revisitation |
46 | Victor Olman, Fenglou Mao, Hongwei Wu, Ying Xu 0001 |
Parallel Clustering Algorithm for Large Data Sets with Applications in Bioinformatics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE ACM Trans. Comput. Biol. Bioinform. ![In: IEEE ACM Trans. Comput. Biol. Bioinform. 6(2), pp. 344-352, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
genome application, Pattern recognition, parallel processing, clustering algorithm |
46 | Seth Pettie, Vijaya Ramachandran |
Randomized minimum spanning tree algorithms using exponentially fewer random bits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 4(1), pp. 5:1-5:27, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Graph algorithms, minimum spanning trees, random sampling |
46 | Amos Korman, Shay Kutten |
Distributed verification of minimum spanning trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 20(4), pp. 253-266, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Graph property verification, Proof labeling schemes, Self stabilization, Minimum spanning tree, Labeling schemes, Network algorithms |
46 | Peilin Jiang, Hua Xiang 0003, Fuji Ren, Shingo Kuroiwa, Nanning Zheng 0001 |
The Framework of Mental State Transition Analysis. ![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. 1046-1055, 2007, Springer, 978-3-540-76630-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Mental State Transition, Psychological Experiment, HCI, Virtual Character |
46 | Amos Korman, Shay Kutten |
Distributed verification of minimum spanning trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, PODC 2006, Denver, CO, USA, July 23-26, 2006, pp. 26-34, 2006, ACM, 1-59593-384-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
graph property verification, proof labeling, distributed algorithms, self stabilization, minimum spanning tree, labeling schemes, network algorithms |
46 | Kunihiko Fukushima, Kazuya Tohyama |
Neural Network Model for Extracting Optic Flow. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICANN (1) ![In: Artificial Neural Networks: Biological Inspirations - ICANN 2005, 15th International Conference, Warsaw, Poland, September 11-15, 2005, Proceedings, Part I, pp. 455-460, 2005, Springer, 3-540-28752-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
46 | Ahmed A. Belal, Amr Elmasry |
Finding maximum-cost minimum spanning trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AICCSA ![In: 2005 ACS / IEEE International Conference on Computer Systems and Applications (AICCSA 2005), January 3-6, 2005, Cairo, Egypt, pp. 14, 2005, IEEE Computer Society, 0-7803-8735-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
46 | Peng-Jun Wan, Gruia Calinescu, Chih-Wei Yi |
Minimum-power multicast routing in static ad hoc wireless networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 12(3), pp. 507-514, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
approximation algorithms, power control, multicast routing |
46 | Sang-Moon Soak, David Corne, Byung-Ha Ahn |
A Powerful New Encoding for Tree-Based Combinatorial Optimisation Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPSN ![In: Parallel Problem Solving from Nature - PPSN VIII, 8th International Conference, Birmingham, UK, September 18-22, 2004, Proceedings, pp. 430-439, 2004, Springer, 3-540-23092-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
46 | Paolo Penna, Carmine Ventre |
Energy-efficient broadcasting in ad-hoc networks: combining MSTs with shortest-path trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PE-WASUN ![In: Proceedings of the 1st ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks, PE-WASUN 2004, Venezia, Italy, October 4, 2004, pp. 61-68, 2004, ACM, 1-58113-959-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
light approximate shortest-path trees, wireless ad hoc networks, energy consumption, multicast trees |
46 | Andrew Beveridge, Alan M. Frieze, Colin McDiarmid |
Random Minimum Length Spanning Trees in Regular Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 18(3), pp. 311-333, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 05C80, 60C05 |
46 | Gabriel Robins, Jeffrey S. Salowe |
On the Maximum Degree of Minimum Spanning Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Tenth Annual Symposium on Computational Geometry, Stony Brook, New York, USA, June 6-8, 1994, pp. 250-258, 1994, ACM, 0-89791-648-4. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
42 | JianLiang Meng, WeiXiang Cheng |
MST Clustering Algorithm Based on Optimized Grid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IIH-MSP ![In: 4th International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2008), Harbin, China, 15-17 August 2008, Proceedings, pp. 370-373, 2008, IEEE Computer Society, 978-0-7695-3278-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
grid-based, center points, MST |
37 | Fadi Saar |
Mst-based cluster analysis: A New algorithm for determining inconsistent edges (Mst tabanlı küme analizi: Tutarsız kenarları belirlemek için yeni bir algoritma) ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2021 |
RDF |
|
37 | Rintu Panja, Sathish Vadhiyar |
MND-MST: A Multi-Node Multi-Device Parallel Boruvka's MST Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP ![In: Proceedings of the 47th International Conference on Parallel Processing, ICPP 2018, Eugene, OR, USA, August 13-16, 2018, pp. 20:1-20:10, 2018, ACM. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
37 | F. Javier Luque, Margarida Bachs, Modesto Orozco |
An Optimized AM1/MST Method for the MST-SCRF Representation of Solvated Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Chem. ![In: J. Comput. Chem. 15(8), pp. 847-857, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
36 | Baruch Awerbuch, Yossi Azar |
Buy-at-Bulk Network Design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 38th Annual Symposium on Foundations of Computer Science, FOCS '97, Miami Beach, Florida, USA, October 19-22, 1997, pp. 542-547, 1997, IEEE Computer Society, 0-8186-8197-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
buy-at-bulk network design, central network switch, multi-sink network design, selective network design, Generalized Steiner Connectivity, Prize-collecting salesman, K-MST, connectivity, network routing, network capacity |
35 | Prasad Chebolu, Alan M. Frieze, Páll Melsted, Gregory B. Sorkin |
Average-Case Analyses of Vickrey Costs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings, pp. 434-447, 2009, Springer, 978-3-642-03684-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
VCG auction, Random Assignment Problem, shortest path, minimum spanning tree, random graph, Average-case analysis, MST |
35 | Xiang Fan, Shun-ren Xia |
Feature Based Automatic Stitching of Microscopic Images. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIC (3) ![In: Advanced Intelligent Computing Theories and Applications. With Aspects of Contemporary Intelligent Computing Techniques, Third International Conference on Intelligent Computing, ICIC 2007, Qingdao, China, August 21-24, 2007. Proceedings, pp. 791-800, 2007, Springer, 978-3-540-74281-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
BBF, SIFT, Image Stitching, Microscopic Image, MST |
35 | Sanghyun Ahn, David Hung-Chang Du |
A Multicast Tree Algorithm Considering Maximum Delay Bound for Real-Time Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCN ![In: Proceedings 21st Conference on Local Computer Networks, Minneapolis, Minnesota, USA, October 13-16, 1996, pp. 172-181, 1996, IEEE Computer Society, 0-8186-7617-5. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
multicast tree algorithm, maximum delay bound, multiple multicast tree concept, tree maintenance cost, DBMT problem, shortest path tree-based DBMT, minimal Steiner tree-based DBMT, MST DBMT, SPT DBMT, performance analysis, group communication, NP-hardness, heuristic algorithms, real-time applications, multicast routing, telecommunication traffic, real-time traffic |
35 | Patricia C. Arocena, Ariel Fuxman, Renée J. Miller |
Composing local-as-view mappings: closure and applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDT ![In: Database Theory - ICDT 2010, 13th International Conference, Lausanne, Switzerland, March 23-25, 2010, Proceedings, pp. 209-218, 2010, ACM, 978-1-60558-947-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
35 | Lélia Blin, Maria Potop-Butucaru, Stephane Rovedakis, Sébastien Tixeuil |
A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free Property. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 23rd International Symposium, DISC 2009, Elche, Spain, September 23-25, 2009. Proceedings, pp. 407-422, 2009, Springer, 978-3-642-04354-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
35 | Hirotaka Susukida, Fei Ma, Mariusz Bajger |
Automatic tuning of a graph-based image segmentation method for digital mammography applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISBI ![In: Proceedings of the 2008 IEEE International Symposium on Biomedical Imaging: From Nano to Macro, Paris, France, May 14-17, 2008, pp. 89-92, 2008, IEEE, 978-1-4244-2003-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
35 | MohammadAli Safari, Mohammad R. Salavatipour |
A Constant Factor Approximation for Minimum lambda-Edge-Connected k-Subgraph with Metric Costs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings, pp. 233-246, 2008, Springer, 978-3-540-85362-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
35 | Carla Silva Rocha Aguiar, Sébastien Druon, André Crosnier |
3D datasets segmentation based on local attribute variation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IROS ![In: 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems, October 29 - November 2, 2007, Sheraton Hotel and Marina, San Diego, California, USA, pp. 3205-3210, 2007, IEEE, 978-1-4244-0912-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
35 | R. Ravi 0001, Mohit Singh |
Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I, pp. 169-180, 2006, Springer, 3-540-35904-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
35 | Mirela Damian, Saurav Pandit, Sriram V. Pemmaraju |
Distributed Spanner Construction in Doubling Metric Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OPODIS ![In: Principles of Distributed Systems, 10th International Conference, OPODIS 2006, Bordeaux, France, December 12-15, 2006, Proceedings, pp. 157-171, 2006, Springer, 3-540-49990-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
35 | Naveed Iqbal Rao, Huijun Di, Guangyou Xu |
Refine Stereo Correspondence Using Bayesian Network and Dynamic Programming on a Color Based Minimal Span Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACIVS ![In: Advanced Concepts for Intelligent Vision Systems, 8th International Conference, ACIVS 2006, Antwerp, Belgium, September 18-21, 2006, Proceedings, pp. 610-619, 2006, Springer, 3-540-44630-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
35 | Timothy M. Chan |
Finding the shortest bottleneck edge in a parametric minimum spanning tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 917-918, 2005, SIAM, 0-89871-585-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
35 | MarÃa Isabel González Vasco, Consuelo MartÃnez, Rainer Steinwandt |
Towards a Uniform Description of Several Group Based Cryptographic Primitives. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 33(3), pp. 215-226, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
group-based cryptography, finitely presented groups, public key cryptography |
35 | Francisco Javier Ovalle-MartÃnez, Ivan Stojmenovic, Fabián GarcÃa Nocetti, Julio Solano-González |
Finding Minimum Transmission Radii for Preserving Connectivity and Constructing Minimal Spanning Trees in Ad Hoc and Sensor Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WEA ![In: Experimental and Efficient Algorithms, Third International Workshop, WEA 2004, Angra dos Reis, Brazil, May 25-28, 2004, Proceedings, pp. 369-382, 2004, Springer, 3-540-22067-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
35 | Xiuzhen Cheng 0001, Bhagirath Narahari, Rahul Simha, Maggie Xiaoyan Cheng, Dan Liu |
Strong Minimum Energy Topology in Wireless Sensor Networks: NP-Completeness and Heuristics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Mob. Comput. ![In: IEEE Trans. Mob. Comput. 2(3), pp. 248-256, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Minimum energy topology, incremental power heuristic, wireless sensor networks, NP-Completeness, power control |
35 | Anil K. Jain 0001, Xiaowei Xu, Tin Kam Ho, Fan Xiao |
Uniformity Testing Using Minimal Spanning Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPR (4) ![In: 16th International Conference on Pattern Recognition, ICPR 2002, Quebec, Canada, August 11-15, 2002., pp. 281-284, 2002, IEEE Computer Society, 0-7695-1695-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
35 | Li-Jen Mao, Sheau-Dong Lang |
Parallel Algorithms for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains and the Heap-Traversal Technique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP Workshops ![In: 31st International Conference on Parallel Processing Workshops (ICPP 2002 Workshops), 20-23 August 2002, Vancouver, BC, Canada, pp. 398-404, 2002, IEEE Computer Society, 0-7695-1680-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Parallel approximate algorithm, degree-constrained minimum spanning tree, nearest neighbor chain, heap traversal |
35 | Narsingh Deo, Ayman M. Abdalla |
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, 4th Italian Conference, CIAC 2000, Rome, Italy, March 2000, Proceedings, pp. 17-31, 2000, Springer, 3-540-67159-5. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
35 | Mikkel Thorup, David R. Karger |
Dynamic Graph Algorithms with Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2000, 7th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 5-7, 2000, Proceedings, pp. 1-9, 2000, Springer, 3-540-67690-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
35 | Alan R. Dennis, Joseph S. Valacich, Cheri Speier, Michael G. Morris |
Beyond Media Richness: An Empirical Test of Media Synchronicity Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HICSS (1) ![In: Thirty-First Annual Hawaii International Conference on System Sciences, Kohala Coast, Hawaii, USA, January 6-9, 1998, pp. 48-57, 1998, IEEE Computer Society, 0-8186-8255-8. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
35 | Gheorghe Antonoiu, Pradip K. Srimani |
Distributed Self-Stabilizing Algorithm for Minimum Spanning Tree Construction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par ![In: Euro-Par '97 Parallel Processing, Third International Euro-Par Conference, Passau, Germany, August 26-29, 1997, Proceedings, pp. 480-487, 1997, Springer, 3-540-63440-1. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
35 | Jeff Griffith, Gabriel Robins, Jeffrey S. Salowe, Tongtong Zhang |
Closing the gap: near-optimal Steiner trees in polynomial time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 13(11), pp. 1351-1365, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
35 | Barun Chandra, Gautam Das 0001, Giri Narasimhan, José Soares |
New Sparseness Results on Graph Spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Eighth Annual Symposium on Computational Geometry, Berlin, Germany, June 10-12, 1992, pp. 192-201, 1992, ACM, 0-89791-517-8. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
35 | Jan-Ming Ho, Gopalakrishnan Vijayan, Chak-Kuen Wong |
New algorithms for the rectilinear Steiner tree problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 9(2), pp. 185-193, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
30 | Ioannis Caragiannis, Michele Flammini, Luca Moscardelli |
An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings, pp. 447-458, 2007, Springer, 978-3-540-73419-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Sanjeev Arora, George Karakostas |
A 2 + epsilon approximation algorithm for the k-MST problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 107(3), pp. 491-504, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
k-Minimum Spanning Tree, Primal-Dual schema, Approximation algorithm |
30 | Toshihiro Fujito |
How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I, pp. 431-442, 2006, Springer, 3-540-35904-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
30 | Clinton Nielsen, Xiaobo Li 0001 |
MST for Lossy Compression of Image Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DCC ![In: 2006 Data Compression Conference (DCC 2006), 28-30 March 2006, Snowbird, UT, USA, pp. 463, 2006, IEEE Computer Society, 0-7695-2545-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
30 | Ning Li 0014, Jennifer C. Hou, Lui Sha |
Design and analysis of an MST-based topology control algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Wirel. Commun. ![In: IEEE Trans. Wirel. Commun. 4(3), pp. 1195-1206, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
30 | W. Jongkind |
The Dutch MST Program MicroNed and its Cluster MISAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICMENS ![In: 2005 International Conference on MEMS, NANO, and Smart Systems (ICMENS 2005), 24-27 July 2005, Banff, Alberta, Canada, pp. 261-262, 2005, IEEE Computer Society, 0-7695-2398-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
30 | Andrea E. F. Clementi, Miriam Di Ianni, Angelo Monti, Massimo Lauria, Gianluca Rossi, Riccardo Silvestri |
Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIROCCO ![In: Structural Information and Communication Complexity, 12th International Colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24-26, 2005, Proceedings, pp. 89-98, 2005, Springer, 3-540-26052-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
30 | Sanjeev Arora, Kevin L. Chang |
Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 40(3), pp. 189-210, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Degree-Restricted Minimum Spanning Tree, Low degree, Approximation algorithm |
30 | Xiang-Yang Li 0001, Yu Wang 0003, Wen-Zhan Song 0001 |
Applications of k-Local MST for Topology Control and Broadcasting in Wireless Ad Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 15(12), pp. 1057-1069, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
broadcasting, wireless ad hoc networks, topology control, minimum spanning tree, Localized algorithms |
30 | Sanjeev Arora, Kevin L. Chang |
Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings, pp. 176-188, 2003, Springer, 3-540-40493-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
30 | Jochen Könemann, R. Ravi 0001 |
Primal-dual meets local search: approximating MST's with nonuniform degree bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, pp. 389-395, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
degree-bounded spanning trees, approximation algorithms, spanning trees, network algorithms, bicriteria approximation |
30 | Jeonghun Cho, Yunheung Paek, David B. Whalley |
Efficient register and memory assignment for non-orthogonal architectures via graph coloring and MST algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCTES-SCOPES ![In: Proceedings of the 2002 Joint Conference on Languages, Compilers, and Tools for Embedded Systems & Software and Compilers for Embedded Systems (LCTES'02-SCOPES'02), Berlin, Germany, 19-21 June 2002, pp. 130-138, 2002, ACM, 1-58113-527-0. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
dual memory, memory assignment, non-orthogonal architecture, compiler, graph coloring, maximum spanning tree |
30 | David Peleg, Vitaly Rubinovich |
A Near-Tight Lower Bound on the Time Complexity of Distributed MST Construction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 40th Annual Symposium on Foundations of Computer Science, FOCS '99, 17-18 October, 1999, New York, NY, USA, pp. 253-261, 1999, IEEE Computer Society, 0-7695-0409-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
30 | Paolo Ferragina |
An EREW PRAM fully-dynamic algorithm for MST. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPPS ![In: Proceedings of IPPS '95, The 9th International Parallel Processing Symposium, April 25-28, 1995, Santa Barbara, California, USA, pp. 93-100, 1995, IEEE Computer Society, 0-8186-7074-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
EREW PRAM fully-dynamic algorithm, undirected weighted graph, single edge insertions, single edge deletions, sparsification data structure, parallel algorithms, parallel algorithm, computational complexity, time, trees (mathematics), minimum spanning tree, tree data structures, nodes, work |
26 | Md. Abdur Rahman, Aminul Huq, Salma Sultana Tunny, Maruf Hossain Anik, Mst. Tasnim Pervin, Md. Rashidul Islam |
A feasibility analysis of image approximation with image quality assessments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IET Image Process. ![In: IET Image Process. 18(4), pp. 897-913, March 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
26 | Md Hadisur Rahman, Md. Rabiul Hasan, Nahian Ismail Chowdhury, Md Asif Bin Syed, Mst Ummul Farah |
Predictive Health Analysis in Industry 5.0: A Scientometric and Systematic Review of Motion Capture in Construction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.01689, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
26 | Utsha Roy, Mst. Sazia Tahosin, Md. Mahedi Hassan, Taminul Islam, Fahim Imtiaz, Md Rezwane Sadik, Yassine Maleh, Rejwan Bin Sulaiman, Md. Simul Hasan Talukder |
Enhancing Bangla Fake News Detection Using Bidirectional Gated Recurrent Units and Deep Learning Techniques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2404.01345, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
26 | Azmine Toushik Wasi, Raima Islam, Mst Rafia Islam |
Ink and Individuality: Crafting a Personalised Narrative in the Age of LLMs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2404.00026, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
26 | Azmine Toushik Wasi, Mst Rafia Islam, Raima Islam |
LLMs as Writing Assistants: Exploring Perspectives on Sense of Ownership and Reasoning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2404.00027, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
26 | Mst Shamim Ara Shawkat, Md Musabbir Adnan, Rocco D. Febbo, John J. Murray, Garrett S. Rose |
A Single Chip SPAD Based Vision Sensing System With Integrated Memristive Spiking Neuromorphic Processing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 11, pp. 19441-19457, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Amena Begum Farha, Md. Azizul Hakim, Mst. Eshita Khatun |
Local Rose Breeds Detection System Using Transfer Learning Techniques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2304.03509, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Mst. Shapna Akter, Hossain Shahriar, Sheikh Iqbal Ahamed, Kishor Datta Gupta, Muhammad Asadur Rahman, Atef Mohamed, Mohammad Rahman, Akond Rahman, Fan Wu 0013 |
Case Study-Based Approach of Quantum Machine Learning in Cybersecurity: Quantum Support Vector Machine for Malware Classification and Protection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2306.00284, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Mst. Shapna Akter, Juanjose Rodriguez-Cardenas, Hossain Shahriar, Akond Rahman, Fan Wu 0013 |
Teaching DevOps Security Education with Hands-on Labware: Automated Detection of Security Weakness in Python. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2311.16944, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Mst. Shapna Akter, Hossain Shahriar, Alfredo Cuzzocrea |
Autism Disease Detection Using Transfer Learning Techniques: Performance Comparison Between Central Processing Unit vs Graphics Processing Unit Functions for Neural Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2306.00283, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Aakash Ahmad, Muhammad Waseem, Peng Liang 0001, Mahdi Fahmideh, Mst Shamima Aktar, Tommi Mikkonen |
Towards Human-Bot Collaborative Software Architecting with ChatGPT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2302.14600, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Mst. Shapna Akter, Hossain Shahriar, Alfredo Cuzzocrea, Nova Ahmed, Carson K. Leung |
Handwritten Word Recognition using Deep Learning Approach: A Novel Way of Generating Handwritten Words. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2303.07514, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Md. Simul Hasan Talukder, Mohammad Raziuddin Chowdhury, Md Sakib Ullah Sourav, Abdullah Al Rakin, Shabbir Ahmed Shuvo, Rejwan Bin Sulaiman, Musarrat Saberin Nipun, Muntarin Islam, Mst Rumpa Islam, Md Aminul Islam, Zubaer Haque |
JutePestDetect: An Intelligent Approach for Jute Pest Identification Using Fine-Tuned Transfer Learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2308.05179, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Mst. Shapna Akter, Hossain Shahriar, Alfredo Cuzzocrea |
A Trustable LSTM-Autoencoder Network for Cyberbullying Detection on Social Media Using Synthetic Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2308.09722, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Md. Hamjajul Ashmafee, Tasnim Ahmed, Sabbir Ahmed, Md. Bakhtiar Hasan, Mst Nura Jahan, A. B. M. Ashikur Rahman |
An Efficient Transfer Learning-based Approach for Apple Leaf Disease Classification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2304.06520, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Mst. Shapna Akter, Md. Jobair Hossain Faruk, Nafisa Anjum, Mohammad Masum, Hossain Shahriar, Akond Rahman, Fan Wu 0013, Alfredo Cuzzocrea |
Software Supply Chain Vulnerabilities Detection in Source Code: Performance Comparison between Traditional and Quantum Machine Learning Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2306.08060, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Mst. Shapna Akter, Hossain Shahriar, Iysa Iqbal, Md Faruque Hossain, M. A. Karim, Victor Clincy, Razvan Voicu |
Exploring the Vulnerabilities of Machine Learning and Quantum Machine Learning to Adversarial Attacks using a Malware Dataset: A Comparative Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.19593, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Mst. Shapna Akter, Hossain Shahriar, Zakirul Alam Bhuiya |
Automated Vulnerability Detection in Source Code Using Quantum Natural Language Processing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2303.07525, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 683 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ >>] |
|