Sciweavers

177 search results - page 14 / 36
» Distributed Discovery of Large Near-Cliques
Sort
View
PKDD
2009
Springer
137views Data Mining» more  PKDD 2009»
14 years 1 months ago
On Subgroup Discovery in Numerical Domains
Subgroup discovery is a Knowledge Discovery task that aims at finding subgroups of a population with high generality and distributional unusualness. While several subgroup discove...
Henrik Grosskreutz, Stefan Rüping
WCNC
2008
IEEE
14 years 1 months ago
A Density Adaptive Routing Protocol for Large-Scale Ad Hoc Networks
Abstract—Position-based routing protocols use location information to refine the traditional packet flooding method in mobile ad hoc networks. They mainly focus on densely and ...
Zhizhou Li, Yaxiong Zhao, Yong Cui, Dong Xiang
CCGRID
2006
IEEE
13 years 11 months ago
Density-Based Clustering for Similarity Search in a P2P Network
P2P systems represent a large portion of the Internet traffic which makes the data discovery of great importance to the user and the broad Internet community. Hence, the power of ...
Mouna Kacimi, Kokou Yétongnon
CONEXT
2005
ACM
13 years 9 months ago
Location based placement of whole distributed systems
The high bandwidth and low latency of the modern internet has made possible the deployment of distributed computing platforms. The XenoServer platform provides a distributed compu...
David Spence, Jon Crowcroft, Steven Hand, Timothy ...
INFOCOM
2010
IEEE
13 years 5 months ago
Routing Primitives for Wireless Mesh Networks: Design, Analysis and Experiments
—In this paper, we consider routing in multi-hop wireless mesh networks. We analyze three standardized and commonly deployed routing mechanisms that we term “nodepair discovery...
Stanislav Miskovic, Edward W. Knightly