Sciweavers

4192 search results - page 783 / 839
» Efficient testing of groups
Sort
View
CCS
2008
ACM
13 years 10 months ago
Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
Ali Bagherzandi, Jung Hee Cheon, Stanislaw Jarecki
CSCWD
2008
Springer
13 years 9 months ago
Development of a project level performance measurement model for improving collaborative design team work
This research explored a new direction of improving collaborative design by performance measurement. More specifically, a novel 3-dimensional performance measurement model is deve...
Yuanyuan Yin, Shengfeng Qin, Ray Holland
MASCOTS
2008
13 years 9 months ago
Tackling the Memory Balancing Problem for Large-Scale Network Simulation
A key obstacle to large-scale network simulation over PC clusters is the memory balancing problem where a memory-overloaded machine can slow down an entire simulation due to disk ...
Hyojeong Kim, Kihong Park
DAGSTUHL
2006
13 years 9 months ago
Point-set algorithms for pattern discovery and pattern matching in music
An algorithm that discovers the themes, motives and other perceptually significant repeated patterns in a musical work can be used, for example, in a music information retrieval sy...
David Meredith
DMIN
2006
111views Data Mining» more  DMIN 2006»
13 years 9 months ago
Profiling and Clustering Internet Hosts
Identifying groups of Internet hosts with a similar behavior is very useful for many applications of Internet security control, such as DDoS defense, worm and virus detection, dete...
Songjie Wei, Jelena Mirkovic, Ezra Kissel