Sciweavers

13603 search results - page 2470 / 2721
» On the Complexity of Computing Treelength
Sort
View
ASIACRYPT
2007
Springer
15 years 10 months ago
Simple and Efficient Perfectly-Secure Asynchronous MPC
Secure multi-party computation (MPC) allows a set of n players to securely compute an agreed function of their inputs, even when up to t players are under the control of an adversa...
Zuzana Beerliová-Trubíniová, ...
CF
2007
ACM
15 years 10 months ago
Parallel genomic sequence-search on a massively parallel system
In the life sciences, genomic databases for sequence search have been growing exponentially in size. As a result, faster sequencesearch algorithms to search these databases contin...
Oystein Thorsen, Brian E. Smith, Carlos P. Sosa, K...
168
Voted
CHIMIT
2007
ACM
15 years 10 months ago
Network-centricity: hindered by hierarchical anchors
Network-centricity is a concept under consideration as a useful paradigm for complex organizational operations, combining the strengths of bureaucracy with the innovative possibil...
Steve Abrams, Gloria Mark
CSIE
2009
IEEE
15 years 10 months ago
An Efficient Mixed-Mode Execution Environment for C on Mobile Phone Platforms
Mobile devices are constrained in terms of computational power, battery lifetime and memory sizes. Software development for mobile devices is further complicated by application co...
Taekhoon Kim, Sungho Kim, Kirak Hong, Hwangho Kim,...
PODC
2010
ACM
15 years 10 months ago
Eventually linearizable shared objects
Linearizability is the strongest known consistency property of shared objects. In asynchronous message passing systems, Linearizability can be achieved with 3S and a majority of c...
Marco Serafini, Dan Dobre, Matthias Majuntke, P&ea...
« Prev « First page 2470 / 2721 Last » Next »