2542 search results - page 480 / 509 » Computing Cartograms with Optimal Complexity |
ASIACRYPT
2007
Springer
14 years 25 days ago
2007
Springer
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...
CF
2007
ACM
14 years 25 days ago
2007
ACM
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...
CSIE
2009
IEEE
14 years 22 days ago
2009
IEEE
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...
CG
2004
Springer
14 years 18 days ago
2004
Springer
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
SC
1995
ACM
14 years 11 days ago
1995
ACM
Release consistency is a widely accepted memory model for distributed shared memory systems. Eager release consistency represents the state of the art in release consistent protoc...