Sciweavers

2229 search results - page 322 / 446
» Comparative analysis of biclustering algorithms
Sort
View
SIGECOM
2008
ACM
122views ECommerce» more  SIGECOM 2008»
13 years 10 months ago
On the windfall of friendship: inoculation strategies on social networks
This paper studies a virus inoculation game on social networks. A framework is presented which allows the measuring of the windfall of friendship, i.e., how much players benefit i...
Dominic Meier, Yvonne Anne Oswald, Stefan Schmid, ...
TOCS
2008
107views more  TOCS 2008»
13 years 10 months ago
RaWMS - Random Walk Based Lightweight Membership Service for Wireless Ad Hoc Networks
RaWMS is a novel lightweight random membership service for ad hoc networks. The service provides each node with a partial uniformly chosen view of network nodes. Such a membership...
Ziv Bar-Yossef, Roy Friedman, Gabriel Kliot
KES
2007
Springer
13 years 10 months ago
Adapting robot kinematics for human-arm motion recognition
Abstract. This paper presents a novel method to the analysis of human-arm motion, in particular improving the efficiency of conventional motion recognition algorithms. Contrary to...
Chee Seng Chan, Honghai Liu, David Brown
ISCI
2000
92views more  ISCI 2000»
13 years 10 months ago
Quantum associative memory
This paper combines quantum computation with classical neural network theory to produce a quantum computational learning algorithm. Quantum computation uses microscopic quantum lev...
Dan Ventura, Tony R. Martinez
SAC
2002
ACM
13 years 10 months ago
The P-tree algebra
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
Qin Ding, Maleq Khan, Amalendu Roy, William Perriz...