Inhaltsverzeichnis
Auswahl der wissenschaftlichen Literatur zum Thema „Connectivity of the median set“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Connectivity of the median set" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Zeitschriftenartikel zum Thema "Connectivity of the median set"
Kende, Michael, Sonia Livingstone, Scott Minehane, Michael Minges, Simon Molloy und George Sciadas. „GLOBAL CONNECTIVTY REPORT 2022. CHAPTER 2. THE JOURNEY TO UNIVERSAL AND MEANINGFUL CONNECTIVITY“. SYNCHROINFO JOURNAL 8, Nr. 3 (2022): 29–37. http://dx.doi.org/10.36724/2664-066x-2022-8-3-29-37.
Der volle Inhalt der QuelleChen, Rong, Kyunghun Lee und Edward H. Herskovits. „Computational framework for detection of subtypes of neuropsychiatric disorders based on DTI-derived anatomical connectivity“. Neuroradiology Journal 33, Nr. 5 (07.09.2020): 393–99. http://dx.doi.org/10.1177/1971400920950694.
Der volle Inhalt der QuelleBesiris, D., A. Makedonas, G. Economou und S. Fotopoulos. „Combining graph connectivity & dominant set clustering for video summarization“. Multimedia Tools and Applications 44, Nr. 2 (12.05.2009): 161–86. http://dx.doi.org/10.1007/s11042-009-0277-9.
Der volle Inhalt der QuelleKhaniyev, Taghi, Samir Elhedhli und Fatih Safa Erenay. „Spatial Separability in Hub Location Problems with an Application to Brain Connectivity Networks“. INFORMS Journal on Optimization 2, Nr. 4 (Oktober 2020): 320–46. http://dx.doi.org/10.1287/ijoo.2019.0031.
Der volle Inhalt der QuelleSilfverhuth, Minna J., Jukka Remes, Tuomo Starck, Juha Nikkinen, Juha Veijola, Osmo Tervonen und Vesa Kiviniemi. „Directional connectivity of resting state human fMRI data using cascaded ICA-PDC analysis“. Acta Radiologica 52, Nr. 9 (November 2011): 1037–42. http://dx.doi.org/10.1258/ar.2011.110262.
Der volle Inhalt der QuelleFang, Jiliang, Danhong Wang, Qing Zhao, Yang Hong, Yulian Jin, Zhishun Liu, Kehua Zhou et al. „Brain-Gut Axis Modulation of Acupuncture in Functional Dyspepsia: A Preliminary Resting-State fcMRI Study“. Evidence-Based Complementary and Alternative Medicine 2015 (2015): 1–11. http://dx.doi.org/10.1155/2015/860463.
Der volle Inhalt der QuelleKaruza, Elisabeth A., Lauren L. Emberson, Matthew E. Roser, Daniel Cole, Richard N. Aslin und Jozsef Fiser. „Neural Signatures of Spatial Statistical Learning: Characterizing the Extraction of Structure from Complex Visual Scenes“. Journal of Cognitive Neuroscience 29, Nr. 12 (Dezember 2017): 1963–76. http://dx.doi.org/10.1162/jocn_a_01182.
Der volle Inhalt der QuelleWagner, Isabella C., Markus Rütgen und Claus Lamm. „Pattern similarity and connectivity of hippocampal-neocortical regions support empathy for pain“. Social Cognitive and Affective Neuroscience 15, Nr. 3 (März 2020): 273–84. http://dx.doi.org/10.1093/scan/nsaa045.
Der volle Inhalt der QuelleKim, Seung Soo, und Kwang Ik Yang. „0643 Machine Learning Model to Predict Depressive Mood Using Graph Theory Analysis of Polysomnography“. SLEEP 46, Supplement_1 (01.05.2023): A282—A283. http://dx.doi.org/10.1093/sleep/zsad077.0643.
Der volle Inhalt der QuelleRosa, Marcello G. P., Juliana G. M. Soares, Tristan A. Chaplin, Piotr Majka, Sophia Bakola, Kimberley A. Phillips, David H. Reser und Ricardo Gattass. „Cortical Afferents of Area 10 in Cebus Monkeys: Implications for the Evolution of the Frontal Pole“. Cerebral Cortex 29, Nr. 4 (13.04.2018): 1473–95. http://dx.doi.org/10.1093/cercor/bhy044.
Der volle Inhalt der QuelleDissertationen zum Thema "Connectivity of the median set"
Bénéteau, Laurine. „Médians de graphes : algorithmes, connexité et axiomatique“. Electronic Thesis or Diss., Aix-Marseille, 2022. http://www.theses.fr/2022AIXM0512.
Der volle Inhalt der QuelleThe median problem is one of the most investigated problem in metric graph theory. We will start by studying this problem in median graphs. We present a linear time algorithm based on the majority rule which characterize the median in median graphs and on a fast computation of the parallelism classes of the edges (the \Theta-classes) via LexBFS which is a particular breadth first search algorithm.We also provide linear time algorithms to compute the median set in the l_1-cube complexes of median graphs and in event structures. Then, we provide a characterization of the graphs with connected medians in the pth power of the graph and provide a polynomial method to check if a graph is a G^p-connected median graph, extending a result of Bandelt and Chepoi (case p=1). We use this characterization to prove that some important graph classes in metric graph theory have G2-connected medians, such as bipartite Helly graphs and bridged graphs. We will also studied the axiomatic aspect of the median function by investigating the ABC-problem, which determine the graphs (named ABC-graphs) in which the median function is the only consensus function verifying three simples axioms (A) Anonymat, (B) Betweeness and (C) Consistency. We show that modular graphs with G2-connected medians are ABC-graphs and define new axioms allowing us to characterize the median function on some graph classes. For example the graphs with connected medians (including Helly graphs). We also show that a known class of ABC-graphs (graphs satisfying the pairing property) is a proper subclass of bipartite Helly graphs and we investigate their recognition
Taixés, i. Ventosa Jordi. „Connectivity of Julia sets of transcendental meromorphic functions“. Doctoral thesis, Universitat de Barcelona, 2011. http://hdl.handle.net/10803/50391.
Der volle Inhalt der QuelleFisher, Serena Lynn. „Frequency Judgments and Recognition: Additional Evidence for Task Differences“. [Tampa, Fla.] : University of South Florida, 2004. http://purl.fcla.edu/fcla/etd/SFE0000517.
Der volle Inhalt der QuelleZhou, Lixing. „Dynamic generalized (multiple-set) structured canonical correlation analysis (dynamic GCANO): a structural equation model for simultaneous analysis of multiple-subject effective connectivity in functional neuroimaging studies“. Thesis, McGill University, 2014. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=123190.
Der volle Inhalt der QuelleSuivant les méthodes d'imagerie fonctionnelle cérébrale, une connectivité efficace est définie comme influence dépendant de causalité temporelle qu'une certaine région d'intérêt du cerveau (ROI) exerce sur une autre. La modélisation par équation structurelle (SEM) est régulièrement utilisée pour analyser la connectivité efficace. Ces dernières années, diverses méthodes de SEM ont été proposées pour la modélisation de la connectivité efficace. Cependant, il y a eu peu de tentative pour développer des méthodes de SEM pour analyser les modèles communs de connectivité efficace sur-sujets, malgré la prédominance de recherche sur des sujets multiples pour analyser la connectivité efficace. Cette thèse propose une méthode qui comble cette lacune. Cette méthode est appelée dynamique généralisée (multiples ensemble) structuré l'analyse de corrélation canonique (dynamique GCANO). Elle combine généralisée (multiples ensemble) structuré l'analyse de corrélation canonique (GCANO) avec multivariée des séries chronologiques autorégressif dans un cadre unifié. Cette thèse commence par un bref sommaire sur les techniques existantes de SEM et souligne leurs limites pour analyser les données de plusieurs sous réserve pour la connectivité efficace, ce qui a mené à développer la dynamique GCANO. Les techniques de base de la méthode proposée sont ensuite énumérées, y compris les spécifications du cadre de modélisation et un critère d'optimisation pour l'estimation de paramètres, qui est réduit par alternant algorithme des moindres carrés. L'efficacité du dynamique GCANO est démontrée par l'analyse des ensembles de données synthétiques et réels. Les données synthétiques montrent une récupération raisonnable de paramètre par la méthode proposée, alors que les données réelles montrent l'utilité de la méthode dans les recherches empiriques. Plusieurs fonctionnalités du dynamique sont mises en évidence par le biais de ces exemples. En conclusion, la thèse propose des extensions possibles de la méthode proposée.
Camby, Eglantine. „Connecting hitting sets and hitting paths in graphs“. Doctoral thesis, Universite Libre de Bruxelles, 2015. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/209048.
Der volle Inhalt der QuelleTout d’abord, nous considérons les deux problèmes suivants :le problème de vertex cover et celui de dominating set, deux cas particuliers du problème de hitting set. Un vertex cover est un ensemble de sommets qui rencontrent toutes les arêtes alors qu’un dominating set est un ensemble X de sommets tel que chaque sommet n’appartenant pas à X est adjacent à un sommet de X. La version connexe de ces problèmes demande que les sommets choisis forment un sous-graphe connexe. Pour les deux problèmes précédents, nous examinons le prix de la connexité, défini comme étant le rapport entre la taille minimum d’un ensemble répondant à la version connexe du problème et celle d’un ensemble du problème originel. Nous prouvons la difficulté du calcul du prix de la connexité d’un graphe. Cependant, lorsqu’on exige que le prix de la connexité d’un graphe ainsi que de tous ses sous-graphes induits soit borné par une constante fixée, la situation change complètement. En effet, pour les problèmes de vertex cover et de dominating set, nous avons pu caractériser ces classes de graphes pour de petites constantes.
Ensuite, nous caractérisons en termes de dominating sets connexes les graphes Pk- free, graphes n’ayant pas de sous-graphes induits isomorphes à un chemin sur k sommets. Beaucoup de problèmes sur les graphes sont étudiés lorsqu’ils sont restreints à cette classe de graphes. De plus, nous appliquons cette caractérisation à la 2-coloration dans les hypergraphes. Pour certains hypergraphes, nous prouvons que ce problème peut être résolu en temps polynomial.
Finalement, nous travaillons sur le problème de Pk-hitting set. Un Pk-hitting set est un ensemble de sommets qui rencontrent tous les chemins sur k sommets. Nous développons un algorithme d’approximation avec un facteur de performance de 3. Notre algorithme, basé sur la méthode primal-dual, fournit un Pk-hitting set dont la taille est au plus 3 fois la taille minimum d’un Pk-hitting set.
Doctorat en Sciences
info:eu-repo/semantics/nonPublished
Lopes, Roberto Rigolin Ferreira. „Uma abordagem ciente de contexto e embasada por feedbacks para o gerenciamento de handovers em ambientes NGN“. Universidade de São Paulo, 2012. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-05092012-143719/.
Der volle Inhalt der QuelleThe evolution of mobile computing improves communication and collaboration among people. The main pillars of this transformation are: the development and production of mobile devices with multimedia capabilities and equipped with two or more network interfaces, the availability of ubiquitous wireless connectivity and the popularity of online social applications. Online social networks noteworthy features that allow for the creation and sharing of digital content within social circles, also called textit Social Media. Web Services attach the geographic location of the device to the digital content, creating the so-called textit location-based social media. Equipped with their phones and tablets, people are creating and consuming social media anywhere. However, it is a challenge to keep such mobile devices connected in current and next generation wireless network environments textit e.g., multiple ISPs (Internet Service Provider) and multiple communication technologies. Recent researches proposes components for managing wireless connectivity that make simultaneous use of the current and past connectivity context data. Such components are mobility predictors, handovers mechanisms or mobility managers that use connectivity context data in a particular way to achieve its purposes. In this research, we propose feasiable a methodology that orchestrates the main components of the connectivity management in a feedback loop. We argue that the process of gathering connectivity context data can be designed as a sensing system, whose sensors are wireless network interfaces. As part of this sensing system, the social circles may assist the management of connectivity by sharing connectivity context data. The main idea is to use location-based services to share connectivity context data within social circles. Thus, online social networks add scale to the system and enables collaboration around recent, local, and social context data. The goal is to enhance wireless connectivity experiences in terms of QoS ( textit Quality of Service) metrics textit e.g., throughput, latency and signal quality. We report how this data is handled using complex networks metrics e.g., vertexs strength and centrality degree, to identify high density handover areas, define the mobile users reputation and to reveal the networks coverage. Real experiments showed that collaboration can improve QoS metrics from ~18 to ~30% if compared to just use a mobility predictor or a modern operational system, respectively. The discussion unfolds with focus on the collaborations efficiency as function of time, number of users, discovered area size and mobility patterns. The promising experimental results indicate that our solution can enhance mobile users wireless connectivity experiences
Santiago, Pinto Leonor. „Cobertura com restrições de conexidade“. Doctoral thesis, Instituto Superior de Economia e Gestão, 2004. http://hdl.handle.net/10400.5/4705.
Der volle Inhalt der QuelleDado um grafo bipartido com classes de bipartição V e U, uma cobertura é um subconjunto C Ç V em que cada vértice de U é adjacente a pelo menos um vértice de C. 0 problema da cobertura procura uma cobertura de cardinalidade mínima. No contexto da selecção de reservas para a con¬servação de espécies, V é o conjunto de povoamentos passíveis de serem seleccionados para integrar a reserva, U o conjunto de espécies a proteger e as arestas descrevem as ocorrências das espécies nos povoamentos. Algumas coberturas apresentam, no entanto, configurações espaciais que não são ade¬quadas do ponto de vista conservacionista. Por razões de sustentabilidade a fragmentação é considerada um atributo indesejável. Assim, a conexidade tem um papel importante na protecção da biodiversidade e vários autores têm recentemente proposto algoritmos que incorporam a conexidade. Nesta dissertação considera-se a introdução explícita da conexidade no problema da cobertura, de forma a dar resposta a questões relevantes em biologia da conservação.
Given a bipartite graph with bipartition V and U, a cover is a subset C C V such that each node of U is adjacent to at least one node in C. The set cov¬ering problem seeks a minimum cardinality cover. In the context of reserve selection for conservation of species, V is a set of candidate sites from a re¬serve network, U is the set of species to be protected, and the edges describe which species are represented in each site. Some covers however may assume spatial configurations which are not adequate for conservational purposes. For sustainability reasons the fragmentation of existing natural habitats should be avoided. Thus, connectivity appears to be an important issue for persistence of biodiversity, and several authors have recently proposed algorithms which incorporate connectivity. We address the issue of explic¬itly introducing connectivity in the set covering problem, with relevance for conservation biology.
Wightman, Rojas Pedro Mario. „Topology Control in Wireless Sensor Networks“. Scholar Commons, 2010. https://scholarcommons.usf.edu/etd/1807.
Der volle Inhalt der QuelleBergougnoux, Benjamin. „Matrix decompositions and algorithmic applications to (hyper)graphs“. Thesis, Université Clermont Auvergne (2017-2020), 2019. http://www.theses.fr/2019CLFAC025/document.
Der volle Inhalt der QuelleIn the last decades, considerable efforts have been spent to characterize what makes NP-hard problems tractable. A successful approach in this line of research is the theory of parameterized complexity introduced by Downey and Fellows in the nineties.In this framework, the complexity of a problem is not measured only in terms of the input size, but also in terms of a parameter on the input.One of the most well-studied parameters is tree-width, a graph parameter which measures how close a graph is to the topological structure of a tree.It appears that tree-width has numerous structural properties and algorithmic applications.However, only sparse graph classes can have bounded tree-width.But, many NP-hard problems are tractable on dense graph classes.Most of the time, this tractability can be explained by the ability of these graphs to be recursively decomposable along vertex bipartitions $(A,B)$ where the adjacency between $A$ and $B$ is simple to describe.A lot of graph parameters -- called width measures -- have been defined to characterize this ability, the most remarkable ones are certainly clique-width, rank-width, and mim-width.In this thesis, we study the algorithmic properties of these width measures.We provide a framework that generalizes and simplifies the tools developed for tree-width and for problems with a constraint of acyclicity or connectivity such as Connected Vertex Cover, Connected Dominating Set, Feedback Vertex Set, etc.For all these problems, we obtain $2^{O(k)}\cdot n^{O(1)}$, $2^{O(k \log(k))}\cdot n^{O(1)}$, $2^{O(k^2)}\cdot n^{O(1)}$ and $n^{O(k)}$ time algorithms parameterized respectively by clique-width, Q-rank-width, rank-width and mim-width.We also prove that there exists an algorithm solving Hamiltonian Cycle in time $n^{O(k)}$, when a clique-width decomposition of width $k$ is given.Finally, we prove that we can count in polynomial time the minimal transversals of $\beta$-acyclic hypergraphs and the minimal dominating sets of strongly chordal graphs.All these results offer promising perspectives towards a generalization of width measures and their algorithmic applications
Kuo, Tung Wei, und 郭桐惟. „Maximizing Submodular Set Function with Connectivity Constraint: Theory and Application to Networks“. Thesis, 2015. http://ndltd.ncl.edu.tw/handle/ryd6fq.
Der volle Inhalt der Quelle國立清華大學
資訊工程學系
103
In this thesis, we investigate the wireless network deployment problem, which seeks the best deployment of a given limited number of wireless routers. We find that many goals for network deployment, such as maximizing the number of covered users, the size of the coverage area, or the total throughput of the network, can be modelled with a submodular set function. Specifically, given a set of routers, the goal is to find a set of locations S, each of which is equipped with a router, such that S maximizes a predefined submodular set function. However, this deployment problem is more difficult than the traditional maximum submodular set function problem, e.g., the maximum coverage problem, because it requires all the deployed routers to form a connected network. In addition, deploying a router in different locations might consume different costs. To address these challenges, this thesis introduces two approximation algorithms, one for homogeneous deployment cost scenarios and the other for heterogeneous deployment cost scenarios. Our simulations, using synthetic data and real traces of census in Taipei, show that the proposed algorithms not only have theoretical performance guarantee but also achieve better performances than other heuristics in practice.
Bücher zum Thema "Connectivity of the median set"
Dowd, Cate. Digital Journalism, Drones, and Automation. Oxford University Press, 2020. http://dx.doi.org/10.1093/oso/9780190655860.001.0001.
Der volle Inhalt der QuelleAnighoro, Victory. Beginners Guide to Canon EOS R7 Mirrorless Camera: Mastering the Set-Up and Wireless Connectivity Features. Independently Published, 2022.
Den vollen Inhalt der Quelle findenHoffman, Rachel. Dating and Mating in a Techno-Driven World. ABC-CLIO, LLC, 2018. http://dx.doi.org/10.5040/9798400637872.
Der volle Inhalt der QuelleWimer, Christopher, und Timothy M. Smeeding. USA Child Poverty: The Impact of the Great Recession. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198797968.003.0013.
Der volle Inhalt der QuelleGao, Qin. Anti-Poverty Effectiveness. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780190218133.003.0005.
Der volle Inhalt der QuelleEsler, Karen J., Anna L. Jacobsen und R. Brandon Pratt. Planning for the future. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198739135.003.0009.
Der volle Inhalt der QuelleJohansen, Bruce, und Adebowale Akande, Hrsg. Nationalism: Past as Prologue. Nova Science Publishers, Inc., 2021. http://dx.doi.org/10.52305/aief3847.
Der volle Inhalt der QuelleAmir Anwar, Mohammad, und Mark Graham. The Digital Continent. Oxford University Press, 2022. http://dx.doi.org/10.1093/oso/9780198840800.001.0001.
Der volle Inhalt der QuelleKashmeri, Sarwar A. China’s Grand Strategy. ABC-CLIO, LLC, 2019. http://dx.doi.org/10.5040/9798400625732.
Der volle Inhalt der QuelleBuchteile zum Thema "Connectivity of the median set"
Nayyar, Anjali, Nilanjana Bose, Roli Shrivastava, Ria Basu und Sarah Andries. „Social Media in the Time of a Pandemic“. In Global Perspectives of COVID-19 Pandemic on Health, Education, and Role of Media, 289–303. Singapore: Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-99-1106-6_13.
Der volle Inhalt der QuelleSandoval, Cesar, Pablo Adasme und Ali Dehghan Firoozabadi. „Quadratic p-Median Formulations with Connectivity Costs Between Facilities“. In Mobile Web and Intelligent Information Systems, 99–107. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-83164-6_8.
Der volle Inhalt der QuelleFukunaga, Takuro. „Graph Orientations with Set Connectivity Requirements“. In Algorithms and Computation, 265–74. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-10631-6_28.
Der volle Inhalt der QuelleRivoli, Lidia, Rosanna Verde und Antonio Irpino. „The Median of a Set of Histogram Data“. In Topics in Theoretical and Applied Statistics, 37–48. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-27274-0_4.
Der volle Inhalt der QuelleKortsarz, Guy, und Zeev Nutov. „Approximating Node Connectivity Problems via Set Covers“. In Approximation Algorithms for Combinatorial Optimization, 194–205. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-44436-x_20.
Der volle Inhalt der QuelleIwanowski, Marcin. „On Combining Dual Morphological Binary Operators Using Median Set“. In Advances in Intelligent Systems and Computing, 163–70. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-47274-4_19.
Der volle Inhalt der QuelleBelmonte, Rémy, Pim van’t Hof, Marcin Kamiński und Daniël Paulusma. „The price of connectivity for feedback vertex set“. In The Seventh European Conference on Combinatorics, Graph Theory and Applications, 123–28. Pisa: Scuola Normale Superiore, 2013. http://dx.doi.org/10.1007/978-88-7642-475-5_20.
Der volle Inhalt der QuelleFerrer, M., E. Valveny, F. Serratosa, I. Bardají und H. Bunke. „Graph-Based k-Means Clustering: A Comparison of the Set Median versus the Generalized Median Graph“. In Computer Analysis of Images and Patterns, 342–50. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-03767-2_42.
Der volle Inhalt der QuelleMilosz, Robin, Sylvie Hamel und Adeline Pierrot. „Median of 3 Permutations, 3-Cycles and 3-Hitting Set Problem“. In Lecture Notes in Computer Science, 224–36. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-94667-2_19.
Der volle Inhalt der QuelleFan, Chenglin, Jun Luo und Binhai Zhu. „Tight Approximation Bounds for Connectivity with a Color-Spanning Set“. In Algorithms and Computation, 590–600. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-45030-3_55.
Der volle Inhalt der QuelleKonferenzberichte zum Thema "Connectivity of the median set"
Ianeva, Mariana, und Stiliyana Basmadzhieva. „PR OF A TOURISM ORGANIZATION UNDER CONDITIONS OF CRISIS“. In TOURISM AND CONNECTIVITY 2020. University publishing house "Science and Economics", University of Economics - Varna, 2020. http://dx.doi.org/10.36997/tc2020.303.
Der volle Inhalt der QuelleChalermsook, Parinya, Fabrizio Grandoni und Bundit Laekhanukit. „On Survivable Set Connectivity“. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2014. http://dx.doi.org/10.1137/1.9781611973730.3.
Der volle Inhalt der QuelleKasemtaweechok, Chatchai, und Worasait Suwannik. „Training set reduction using Geometric Median“. In 2015 15th International Symposium on Communications and Information Technologies (ISCIT). IEEE, 2015. http://dx.doi.org/10.1109/iscit.2015.7458330.
Der volle Inhalt der QuelleBaidoo, Mark, Marie-Hélène Fillion, Alexander Hutchison und Claudia González. „Controlled Lab-Scale Evaluation of the Secondary Permeability Represented in a 3D Printed Discrete Fracture Network (DFN) Model“. In 3rd International Discrete Fracture Network Engineering Conference. ARMA, 2022. http://dx.doi.org/10.56952/arma-dfne-22-0010.
Der volle Inhalt der QuelleBo, Chen, Geng Zexun, Yang Yang und Liu Xiaosong. „Application of the Rough Set to Image Median Denoising“. In Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007). IEEE, 2007. http://dx.doi.org/10.1109/snpd.2007.201.
Der volle Inhalt der QuelleAl-Rawwash, Mohammad, Mohd Alodat und Inad Nawajah. „Fisher information of the regression parameters using median ranked set sampling“. In PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON MATHEMATICAL SCIENCES. AIP Publishing LLC, 2014. http://dx.doi.org/10.1063/1.4882603.
Der volle Inhalt der QuelleZhu, Xuan, Yanyan Tian, Mingquan Zhou und Jinye Peng. „Curve envolving based on level set method and discrete median filter“. In Sixth International Symposium on Instrumentation and Control Technology: Sensors, Automatic Measurement, Control, and Computer Simulation, herausgegeben von Jiancheng Fang und Zhongyu Wang. SPIE, 2006. http://dx.doi.org/10.1117/12.717802.
Der volle Inhalt der QuelleJekabsone, Inga, und Ina Gudele. „Factors contributing to the regional development of e-commerce in Latvia“. In 21st International Scientific Conference "Economic Science for Rural Development 2020". Latvia University of Life Sciences and Technologies. Faculty of Economics and Social Development, 2020. http://dx.doi.org/10.22616/esrd.2020.53.020.
Der volle Inhalt der QuelleCroccolo, D., T. M. Brugo, M. De Agostinis, S. Fini und G. Olmi. „Experimental Characterization and Finite Element Modeling of Film Capacitors for Automotive Applications“. In ASME 2016 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2016. http://dx.doi.org/10.1115/imece2016-65489.
Der volle Inhalt der QuelleKasparis, T., und George Eichmann. „Fast vector median filter algorithm“. In OSA Annual Meeting. Washington, D.C.: Optica Publishing Group, 1987. http://dx.doi.org/10.1364/oam.1987.mo6.
Der volle Inhalt der QuelleBerichte der Organisationen zum Thema "Connectivity of the median set"
Ketterer, Juan Antonio. Digital Finance: New Times, New Challenges, New Opportunities. Inter-American Development Bank, März 2017. http://dx.doi.org/10.18235/0007028.
Der volle Inhalt der QuelleGoulet, Christine, Yousef Bozorgnia, Nicolas Kuehn, Linda Al Atik, Robert Youngs, Robert Graves und Gail Atkinson. NGA-East Ground-Motion Models for the U.S. Geological Survey National Seismic Hazard Maps. Pacific Earthquake Engineering Research Center, University of California, Berkeley, CA, März 2017. http://dx.doi.org/10.55461/qozj4825.
Der volle Inhalt der QuelleMuniz Costa, Sérgio Paulo, Gala Gómez Minujín, Paolo Giordano, Juan Pedro Brandi, Jorge Lucángeli, Nilo Meza Monge, Daniel Berrettoni, Irasema Infante und Ricardo Carciofi. Integration & Trade Journal: Volume 16 : No. 34 : January-June, 2012. Inter-American Development Bank, Mai 2012. http://dx.doi.org/10.18235/0008076.
Der volle Inhalt der QuelleIyer, Ananth V., Samuel Labi, Steven Dunlop, Thomas Brady Jr. und Eki Amijaya. Cost and Benefit Analysis of Installing Fiber Optics on INDOT Projects. Purdue University, 2020. http://dx.doi.org/10.5703/1288284317131.
Der volle Inhalt der QuelleFajardo, Johanna, und Eduardo Lora. Latin American Middle Classes: The Distance between Perception and Reality. Inter-American Development Bank, Dezember 2011. http://dx.doi.org/10.18235/0011352.
Der volle Inhalt der QuelleO’Brien, Tom, Deanna Matsumoto, Diana Sanchez, Caitlin Mace, Elizabeth Warren, Eleni Hala und Tyler Reeb. Southern California Regional Workforce Development Needs Assessment for the Transportation and Supply Chain Industry Sectors. Mineta Transportation Institute, Oktober 2020. http://dx.doi.org/10.31979/mti.2020.1921.
Der volle Inhalt der QuelleGoulet, Christine, Yousef Bozorgnia, Norman Abrahamson, Nicolas Kuehn, Linda Al Atik, Robert Youngs, Robert Graves und Gail Atkinson. Central and Eastern North America Ground-Motion Characterization - NGA-East Final Report. Pacific Earthquake Engineering Research Center, University of California, Berkeley, CA, Dezember 2018. http://dx.doi.org/10.55461/wdwr4082.
Der volle Inhalt der QuelleKim, Joseph, und Patricia McCarthy. Evaluation of Sustainability Determinants to Develop a Sustainability Rating System for California Infrastructure Construction Projects. Mineta Transportation Institute, Juni 2022. http://dx.doi.org/10.31979/mti.2022.2142.
Der volle Inhalt der QuelleTrembeczki, Zsolt. Blue Chip Networks: Two Case Studies of Countering the Belt and Road Initiative. Külügyi és Külgazdasági Intézet, 2021. http://dx.doi.org/10.47683/kkielemzesek.ke-2021.65.
Der volle Inhalt der QuelleNolan, Brian, Brenda Gannon, Richard Layte, Dorothy Watson, Christopher T. Whelan und James Williams. Monitoring Poverty Trends in Ireland: Results from the 2000 Living in Ireland survey. ESRI, Juli 2002. http://dx.doi.org/10.26504/prs45.
Der volle Inhalt der Quelle