Sciweavers

5012 search results - page 1002 / 1003
» Distributed Error Correction
Sort
View
SODA
2012
ACM
245views Algorithms» more  SODA 2012»
11 years 7 months ago
Lower bounds for number-in-hand multiparty communication complexity, made easy
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
Jeff M. Phillips, Elad Verbin, Qin Zhang
TVCG
2012
248views Hardware» more  TVCG 2012»
11 years 7 months ago
Scanning 3D Full Human Bodies Using Kinects
—Depth camera such as Microsoft Kinect, is much cheaper than conventional 3D scanning devices, and thus it can be acquired for everyday users easily. However, the depth data capt...
Jing Tong, Jin Zhou, Ligang Liu, Zhigeng Pan, Hao ...
SOSP
2007
ACM
14 years 2 months ago
Attested append-only memory: making adversaries stick to their word
Researchers have made great strides in improving the fault tolerance of both centralized and replicated systems against arbitrary (Byzantine) faults. However, there are hard limit...
Byung-Gon Chun, Petros Maniatis, Scott Shenker, Jo...
CCS
2007
ACM
13 years 11 months ago
Filtering spam with behavioral blacklisting
Spam filters often use the reputation of an IP address (or IP address range) to classify email senders. This approach worked well when most spam originated from senders with fix...
Anirudh Ramachandran, Nick Feamster, Santosh Vempa...
STOC
2002
ACM
144views Algorithms» more  STOC 2002»
14 years 5 months ago
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...
Surender Baswana, Ramesh Hariharan, Sandeep Sen
« Prev « First page 1002 / 1003 Last » Next »