Sciweavers

90 search results - page 13 / 18
» New Model and Scheduling Protocol for Transactional Workflow...
Sort
View
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
15 years 1 months ago
Fast asynchronous byzantine agreement and leader election with full information
We resolve two long-standing open problems in distributed computation by describing polylogarithmic protocols for Byzantine agreement and leader election in the asynchronous full ...
Bruce M. Kapron, David Kempe, Valerie King, Jared ...
INFOCOM
2009
IEEE
15 years 6 months ago
Minimum-Latency Beaconing Schedule in Multihop Wireless Networks
— Minimum-latency beaconing schedule (MLBS) in synchronous multihop wireless networks seeks a schedule for beaconing with the shortest latency. This problem is NP-hard even when ...
Peng-Jun Wan, Xiao-Hua Xu, Lixin Wang, Xiaohua Jia...
IUI
2010
ACM
15 years 8 months ago
Agent-assisted task management that reduces email overload
RADAR is a multiagent system with a mixed-initiative user interface designed to help office workers cope with email overload. RADAR agents observe experts to learn models of their...
Aaron Steinfeld, Andrew Faulring, Asim Smailagic, ...
IACR
2011
121views more  IACR 2011»
13 years 11 months ago
Two RFID Privacy Models in Front of a Court
In ASIACRYPT 2007, Vaudenay proposed a comprehensive privacy model for unilateral RFID schemes. Soon after, in ASIACCS 2008, Paise and Vaudenay presented a new version of the cited...
Mohammad Hassan Habibi, Mohammad Reza Aref
104
Voted
VLSISP
2002
112views more  VLSISP 2002»
14 years 11 months ago
Minimizing Buffer Requirements under Rate-Optimal Schedule in Regular Dataflow Networks
Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dat...
Ramaswamy Govindarajan, Guang R. Gao, Palash Desai