Sciweavers

944 search results - page 121 / 189
» A Survey on Counting Networks
Sort
View
VOTEID
2007
Springer
16 years 8 days ago
Threat Analysis of a Practical Voting Scheme with Receipts
Kutylowski et al. have introduced a voter-verifiable electronic voting scheme ”a practical voting scheme with receipts”, which provides each voter with a receipt. The voter ca...
Sébastien Foulle, Steve Schneider, Jacques ...
DATE
2010
IEEE
98views Hardware» more  DATE 2010»
15 years 11 months ago
SigNet: Network-on-chip filtering for coarse vector directories
—Scalable cache coherence is imperative as systems move into the many-core era with cores counts numbering in the hundreds. Directory protocols are often favored as more scalable...
Natalie Enright Jerger
ESA
2010
Springer
220views Algorithms» more  ESA 2010»
15 years 7 months ago
Data Structures for Storing Small Sets in the Bitprobe Model
abstract appeared in Proc. 24th Annual Symposium of Computational Geometry (SoCG), 2008, pp. 338-345. S. Shannigrahi and S. P. Pal, "Efficient Prufer-like Coding and Counting ...
Jaikumar Radhakrishnan, Smit Shah 0001, Saswata Sh...
DIMVA
2009
15 years 7 months ago
Browser Fingerprinting from Coarse Traffic Summaries: Techniques and Implications
We demonstrate that the browser implementation used at a host can be passively identified with significant precision and recall, using only coarse summaries of web traffic to and f...
Ting-Fang Yen, Xin Huang, Fabian Monrose, Michael ...
COMCOM
2006
75views more  COMCOM 2006»
15 years 6 months ago
Finding a least hop(s) path subject to multiple additive constraints
In this paper, for the purpose of saving network resources, we first introduce and investigate a new problem referred to as the least hop(s) multiple additively constrained path (...
Gang Cheng, Nirwan Ansari