Sciweavers

7930 search results - page 641 / 1586
» Greedy in Approximation Algorithms
Sort
View
ICDM
2005
IEEE
122views Data Mining» more  ICDM 2005»
16 years 26 days ago
Finding Representative Set from Massive Data
In the information age, data is pervasive. In some applications, data explosion is a significant phenomenon. The massive data volume poses challenges to both human users and comp...
Feng Pan, Wei Wang 0010, Anthony K. H. Tung, Jiong...
IPPS
2005
IEEE
16 years 25 days ago
A Powerful Direct Mechanism for Optimal WWW Content Replication
This paper addresses the problem of fine-grained data replication in large distributed systems, such as the Internet, so as to minimize the user access delays. With fine-grained d...
Samee Ullah Khan, Ishfaq Ahmad
WACV
2005
IEEE
16 years 24 days ago
Automatic Augmentation and Meshing of Sparse 3D Scene Structure
We propose a novel method of robustly and automatically creating surface meshes from the very sparsely populated 3D point clouds typically produced by Structure from Motion algori...
Oli Cooper, Neill W. Campbell, David P. Gibson
CHES
2005
Springer
156views Cryptology» more  CHES 2005»
16 years 24 days ago
A Very Compact S-Box for AES
A key step in the Advanced Encryption Standard (AES) algorithm is the “S-box.” Many implementations of AES have been proposed, for various goals, that effect the S-box in vari...
David Canright
ISVLSI
2003
IEEE
97views VLSI» more  ISVLSI 2003»
16 years 15 days ago
Q-Tree: A New Iterative Improvement Approach for Buffered Interconnect Optimization
The “chicken-egg” dilemma between VLSI interconnect timing optimization and delay calculation suggests an iterative approach. We separate interconnect timing transformation as...
Andrew B. Kahng, Bao Liu