Sciweavers

1596 search results - page 170 / 320
» Using knowledge nodes for knowledge discovery and collaborat...
Sort
View
CORR
2007
Springer
104views Education» more  CORR 2007»
15 years 4 months ago
Double Clustering and Graph Navigability
Graphs are called navigable if one can find short paths through them using only local knowledge. It has been shown that for a graph to be navigable, its construction needs to mee...
Oskar Sandberg
AAI
2007
132views more  AAI 2007»
15 years 4 months ago
Incremental Extraction of Association Rules in Applicative Domains
In recent years, the KDD process has been advocated to be an iterative and interactive process. It is seldom the case that a user is able to answer immediately with a single query...
Arianna Gallo, Roberto Esposito, Rosa Meo, Marco B...
P2P
2006
IEEE
101views Communications» more  P2P 2006»
15 years 10 months ago
Towards Scalable Mobility in Distributed Hash Tables
For the use in the Internet domain, distributed hash tables (DHTs) have proven to be an efficient and scalable approach to distributed content storage and access. In this paper, ...
Olaf Landsiedel, Stefan Götz, Klaus Wehrle
140
Voted
ATAL
2006
Springer
15 years 7 months ago
Scalable and reliable data delivery in mobile ad hoc sensor networks
This paper studies scalable data delivery algorithms in mobile ad hoc sensor networks with node and link failures. Many algorithms have been developed for data delivery and fusion...
Bin Yu, Paul Scerri, Katia P. Sycara, Yang Xu, Mic...
JSSPP
2005
Springer
15 years 9 months ago
ScoPred-Scalable User-Directed Performance Prediction Using Complexity Modeling and Historical Data
Using historical information to predict future runs of parallel jobs has shown to be valuable in job scheduling. Trends toward more flexible jobscheduling techniques such as adapt...
Benjamin J. Lafreniere, Angela C. Sodan