Sciweavers

3020 search results - page 167 / 604
» Optimal partition trees
Sort
View
174
Voted
ADC
2003
Springer
127views Database» more  ADC 2003»
16 years 8 days ago
M+-tree : A New Dynamical Multidimensional Index for Metric Spaces
In this paper, we propose a new metric index, called M+ -tree, which is a tree dynamically organized for large datasets in metric spaces. The proposed M+ -tree takes full advantag...
Xiangmin Zhou, Guoren Wang, Jeffrey Xu Yu, Ge Yu
CIKM
2003
Springer
16 years 7 days ago
Hierarchical graph indexing
Traffic analysis, in the context of Telecommunications or Internet and Web data, is crucial for large network operations. Data in such networks is often provided as large graphs w...
James Abello, Yannis Kotidis
206
Voted
EJWCN
2010
115views more  EJWCN 2010»
15 years 1 months ago
Efficient Certification Path Discovery for MANET
A Mobile Ad Hoc Network (MANET) is characterized by the lack of any infrastructure, absence of any kind of centralized administration, frequent mobility of nodes, network partitio...
Georgios Kambourakis, Elisavet Konstantinou, Anast...
GLOBECOM
2008
IEEE
15 years 7 months ago
An Efficient Group Key Management for Secure Routing in Ad Hoc Networks
This paper proposes and specifies a protocol for distributing and managing group keys in ad hoc environments, which applies for the Secure Optimized Link State Routing Protocol. Ou...
Natalia Castro Fernandes, Otto Carlos Muniz Bandei...
193
Voted
CORR
2006
Springer
127views Education» more  CORR 2006»
15 years 7 months ago
Post-Processing Hierarchical Community Structures: Quality Improvements and Multi-scale View
Dense sub-graphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Most existing community detection algori...
Pascal Pons