Sciweavers

6409 search results - page 475 / 1282
» A Computational Algorithm for Origami Design
Sort
View
TAMC
2007
Springer
16 years 1 months ago
Approximately Optimal Trees for Group Key Management with Batch Updates
Abstract. We investigate the group key management problem for broadcasting applications. Previous work showed that, in handling key updates, batch rekeying can be more cost-effect...
Minming Li, Ze Feng, Ronald L. Graham, Frances F. ...
GLVLSI
2005
IEEE
110views VLSI» more  GLVLSI 2005»
16 years 15 days ago
QCA channel routing with wire crossing minimization
Quantum-dot Cellular Automata (QCA) is a novel computing mechanism that can represent binary information based on spatial distribution of electron charge configuration in chemica...
Brian Stephen Smith, Sung Kyu Lim
NOSSDAV
2004
Springer
16 years 7 days ago
Distributed server replication in large scale networks
Quality of service for high-bandwidth or delay-sensitive applications in the Internet, such as streaming media and online games, can be significantly improved by replicating serv...
Bong-Jun Ko, Dan Rubenstein
JCDL
2010
ACM
238views Education» more  JCDL 2010»
15 years 12 months ago
BinarizationShop: a user-assisted software suite for converting old documents to black-and-white
Converting a scanned document to a binary format (black and white) is a key step in the digitization process. While many existing binarization algorithms operate robustly for well...
Fanbo Deng, Zheng Wu, Zheng Lu, Michael S. Brown
CHI
2009
ACM
15 years 11 months ago
Make new friends, but keep the old: recommending people on social networking sites
This paper studies people recommendations designed to help users find known, offline contacts and discover new friends on social networking sites. We evaluated four recommender al...
Jilin Chen, Werner Geyer, Casey Dugan, Michael J. ...