Sciweavers

2950 search results - page 260 / 590
» Computing with Infinitely Many Processes
Sort
View
INFOCOM
2012
IEEE
13 years 9 months ago
On the construction of data aggregation tree with minimum energy cost in wireless sensor networks: NP-completeness and approxima
—In many applications, it is a basic operation for the sink to periodically collect reports from all sensors. Since the data gathering process usually proceeds for many rounds, i...
Tung-Wei Kuo, Ming-Jer Tsai
EUROCRYPT
2007
Springer
15 years 10 months ago
Batch Verification of Short Signatures
Abstract. With computer networks spreading into a variety of new environments, the need to authenticate and secure communication grows. Many of these new environments have particul...
Jan Camenisch, Susan Hohenberger, Michael Ø...
NPAR
2004
ACM
16 years 4 days ago
Rendering cracks in Batik
We present an algorithm for simulating the cracks found in Batik wax painting and dyeing technique used to make images on cloth. The algorithm produces cracks similar to those fou...
Brian Wyvill, Cornelius W. A. M. van Overveld, M. ...
ICVS
1999
Springer
15 years 11 months ago
Face-Tracking and Coding for Video Compression
While computing power and transmission bandwidth have both been steadily increasing over the last few years, bandwidth rather than processing power remains the primary bottleneck f...
William E. Vieux, Karl Schwerdt, James L. Crowley
GRID
2006
Springer
15 years 6 months ago
Multi-Replication with Intelligent Staging in Data-Intensive Grid Applications
Existing data grid scheduling systems handle huge data I/O via replica location services coupled with simple staging, decoupled from scheduling of computing tasks. However, when th...
Yuya Machida, Shin'ichiro Takizawa, Hidemoto Nakad...