نتایج جستجو برای: part family clustering

تعداد نتایج: 1131145  

Journal: :Network Protocols & Algorithms 2016
Samira Harrabi Inès Ben Jaâfar Khaled Ghédira

Vehicular Ad-hoc Network (VANET) is a sub-family of Mobile Ad-hoc Network (MANET).The means goal of VANET is to provide communications between nearby nodes or between nodes and fixed infrastructure. Despite that VANET is considered as a subclass of MANET, it has for particularity the high mobility of vehicles producing the frequent changes of network topology that involve changing of road, vary...

2008
Matthew B. Blaschko Arthur Gretton

We introduce a family of unsupervised algorithms, numerical taxonomy clustering, to simultaneously cluster data, and to learn a taxonomy that encodes the relationship between the clusters. The algorithms work by maximizing the dependence between the taxonomy and the original data. The resulting taxonomy is a more informative visualization of complex data than simple clustering; in addition, tak...

Journal: :Monthly Notices of the Royal Astronomical Society 2014

Journal: :European journal of management and business economics 2021

Purpose Work-family conflict is an important topic which had evolution, starting from a static definition, where work and family domains were divided, to more dynamic complex balance. COVID-19 has influenced society created significant distress among families working activity, this been characterised by major interest, considering some old definitions balance was considered problematic but not ...

Journal: :CoRR 2013
Twan van Laarhoven Elena Marchiori

We investigate axioms that intuitively ought to be satisfied by graph clustering objective functions. Two tailored for graph clustering objectives are introduced, and the four axioms introduced in previous work on distance based clustering are reformulated and generalized for the graph setting. We show that modularity, a standard objective for graph clustering, does not satisfy all these axioms...

2005
Helmut Alt Esther M. Arkin Hervé Brönnimann Jeff Erickson Sándor P. Fekete Christian Knauer Jonathan Lenchner Joseph S. B. Mitchell Sue Whitesides Kim Whittlesey

The problem. We study a new geometric optimization problem which arises in carrot crop management [10], as well as wireless network design and various other facililty location problems. The task is to select a number of locations t j for the sprinklers, and assign a radius r j to each sprinkler. A carrot pi is covered iff it is within range of some transmission point t ji , i.e., d(t ji , pi) ≤...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید