4009 search results - page 275 / 802 » Clustering on Complex Graphs |
207
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
162
click to vote
ICPADS
2007
IEEE
16 years 1 months ago
2007
IEEE
- Due to the increasing complexity of scientific models, large-scale simulation tools often require a critical amount of computational power to produce results in a reasonable amou...
177
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
: Security of computers and the networks that connect them is increasingly becoming of great significance. Computer security is defined as the protection of computing systems again...
177
click to vote
TMC
2008
15 years 6 months ago
2008
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
255
click to vote
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...