2104 search results - page 45 / 421 » Sorting with networks of data structures |
143
click to vote
JDA
2006
15 years 3 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
134
Voted
ACSAC
2004
IEEE
15 years 7 months ago
2004
IEEE
1 A number of recent applications have been built on distributed hash tables (DHTs) based overlay networks. Almost all DHT-based schemes employ a tight deterministic data placement...
118
Voted
ICDE
2010
IEEE
15 years 10 months ago
2010
IEEE
— Network clustering enables us to view a complex network at the macro level, by grouping its nodes into units whose characteristics and interrelationships are easier to analyze ...
91
Voted
IDA
1997
Springer
15 years 8 months ago
1997
Springer
This paper evaluates the performance of ten significance measures applied to the problem of determining an appropriate network structure, for data modelling with neurofuzzy syste...
139
click to vote
WEBI
2009
Springer
15 years 10 months ago
2009
Springer
The emergence of scale free and small world properties in real world complex networks has stimulated lots of activity in the field of network analysis. An example of such a netwo...