Sciweavers

948 search results - page 53 / 190
» What can we achieve by arbitrary announcements
Sort
View
SODA
2004
ACM
116views Algorithms» more  SODA 2004»
13 years 9 months ago
Retroactive data structures
We introduce a new data structuring paradigm in which operations can be performed on a data structure not only in the present but also in the past. In this new paradigm, called ret...
Erik D. Demaine, John Iacono, Stefan Langerman
WOTE
2010
13 years 6 months ago
Receipt-Free K-out-of-L Voting Based on ElGamal Encryption
We present a K-out-of-L voting scheme, i.e., a voting scheme that allows every voter to vote for (up to) K candidates from a set of L candidates. The scheme is receipt-free, which ...
Martin Hirt
DATE
2003
IEEE
97views Hardware» more  DATE 2003»
14 years 29 days ago
Enhancing Speedup in Network Processing Applications by Exploiting Instruction Reuse with Flow Aggregation
Instruction reuse is a microarchitectural technique that improves the execution time of a program by removing redundant computations at run-time. Although this is the job of an op...
G. Surendra, Subhasis Banerjee, S. K. Nandy
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
14 years 8 months ago
Near-perfect load balancing by randomized rounding
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
Tobias Friedrich, Thomas Sauerwald
ICIP
2001
IEEE
14 years 9 months ago
Image-based rendering for mixed reality
In this paper, we propose an image-based approach to synthesize a novel view image for mixed reality (MR) systems. Theoretically, the image- based method is good for synthesizing ...
Hiroshi Kawasaki, Hiroyuki Aritaki, Katsushi Ikeuc...