Sciweavers

2303 search results - page 312 / 461
» Interior-Point Methods in Parallel Computation
Sort
View
PODC
2009
ACM
16 years 7 months ago
Correctness of gossip-based membership under message loss
Due to their simplicity and effectiveness, gossip-based membership protocols have become the method of choice for maintaining partial membership in large P2P systems. A variety of...
Maxim Gurevich, Idit Keidar
CAV
2009
Springer
134views Hardware» more  CAV 2009»
16 years 7 months ago
Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints
Abstract. Dynamic Pushdown Networks (DPNs) are a model for parallel programs with (recursive) procedures and process creation. The goal of this paper is to develop generic techniqu...
Alexander Wenner, Markus Müller-Olm, Peter La...
HPCA
2005
IEEE
16 years 6 months ago
A Small, Fast and Low-Power Register File by Bit-Partitioning
A large multi-ported register file is indispensable for exploiting instruction level parallelism (ILP) in today's dynamically scheduled superscalar processors. The number of ...
Masaaki Kondo, Hiroshi Nakamura
CVPR
2008
IEEE
16 years 6 months ago
Real-Time Face Pose Estimation from Single Range Images
We present a real-time algorithm to estimate the 3D pose of a previously unseen face from a single range im- age. Based on a novel shape signature to identify noses in range ima...
Michael D. Breitenstein, Daniel Küttel, Thiba...
ICDCS
2009
IEEE
16 years 1 months ago
Explicit Batching for Distributed Objects
Although distributed object systems, for example RMI and CORBA, enable object-oriented programs to be easily distributed across a network, achieving acceptable performance usually...
Eli Tilevich, William R. Cook, Yang Jiao