Sciweavers

3607 search results - page 623 / 722
» Learning with structured sparsity
Sort
View
ICPADS
2005
IEEE
15 years 10 months ago
Distributed Spanning Tree Algorithms for Large Scale Traversals
— The Distributed Spanning Tree (DST) is an overlay structure designed to be scalable. It supports the growth from small scale to large scale. The DST is a tree without bottlenec...
Sylvain Dahan
HT
2005
ACM
15 years 10 months ago
Distributed, real-time computation of community preferences
We describe the integration of smart digital objects with Hebbian learning to create a distributed, real-time, scalable approach to adapting to a community's preferences. We ...
Thomas Lutkenhouse, Michael L. Nelson, Johan Bolle...
SIGCSE
2005
ACM
98views Education» more  SIGCSE 2005»
15 years 10 months ago
A multi-institutional investigation of computer science seniors' knowledge of programming concepts
Research on learning suggests the importance of helping students organize their knowledge around meaningful patterns of information. This paper reports on a multi-institutional st...
Laurie Murphy, Renée McCauley, Suzanne West...
SPAA
2005
ACM
15 years 10 months ago
Decentralized algorithms using both local and random probes for P2P load balancing
We study randomized algorithms for placing a sequence of n nodes on a circle with unit perimeter. Nodes divide the circle into disjoint arcs. We desire that a newly-arrived node (...
Krishnaram Kenthapadi, Gurmeet Singh Manku
WOWMOM
2005
ACM
240views Multimedia» more  WOWMOM 2005»
15 years 10 months ago
An Adaptive Routing Protocol for Ad Hoc Peer-to-Peer Networks
Ad hoc networks represent a key factor in the evolution of wireless communications. These networks typically consist of equal nodes that communicate without central control, inter...
Luca Gatani, Giuseppe Lo Re, Salvatore Gaglio