3267 search results - page 568 / 654 » Generalized quasirandom graphs |
130
click to vote
PEWASUN
2008
ACM
15 years 6 months ago
2008
ACM
In this paper we present EDAT, a tool designed for the analysis of trace files from network simulations and experiments. The EDAT framework encapsulates analysis steps in extensib...
127
click to vote
LWA
2007
15 years 6 months ago
2007
Large, high dimensional data spaces, are still a challenge for current data clustering methods. Frequent Termset (FTS) clustering is a technique developed to cope with these chall...
139
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
Greedy Routing is a class of routing algorithms in which the packets are forwarded in a manner that reduces the distance to the destination at every step. In an attempt to provide...
147
click to vote
AAAI
2006
15 years 5 months ago
2006
With increasing deployment of systems involving multiple coordinating agents, there is a growing need for diagnosing coordination failures in such systems. Previous work presented...
149
click to vote
CLA
2004
15 years 5 months ago
2004
In Formal Concept Analysis, it is a very important but quite difficult task to draw line diagrams of concept lattices automatically. In particular, we want every planar lattice to ...