Sciweavers

1995 search results - page 117 / 399
» From Data Flow Networks to Process Algebras
Sort
View
INFOSCALE
2007
ACM
15 years 6 months ago
SDI: a swift tree structure for multi-dimensional data indexing in peer-to-peer networks
Efficient multi-dimensional data search has received much attention in centralized systems. However, its implementation in large-scale distributed systems is not a trivial job and...
Rong Zhang, Weining Qian, Minqi Zhou, Aoying Zhou
IMC
2007
ACM
15 years 6 months ago
Issues and etiquette concerning use of shared measurement data
In this note we discuss issues surrounding how to provide and use network measurement data made available for sharing among researchers. While previous work has focused on the tec...
Mark Allman, Vern Paxson
IJDMB
2008
105views more  IJDMB 2008»
15 years 4 months ago
Temporal representation for gene networks: towards a qualitative temporal data mining
: Recently lots of studies aim at modeling and inferring gene networks. Modeling tools propose graphical models having almost nothing about time description of events and regards t...
Nicolas Turenne, Sylviane R. Schwer
CIKM
2008
Springer
15 years 6 months ago
A measure for cluster cohesion in semantic overlay networks
Semantic overlay networks cluster peers that are semantically, thematically or socially close into groups by means of a rewiring procedure that is periodically executed by each pe...
Paraskevi Raftopoulou, Euripides G. M. Petrakis
INFOCOM
2006
IEEE
15 years 10 months ago
Theory and Network Applications of Dynamic Bloom Filters
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo