Sciweavers

670 search results - page 132 / 134
» Intractability and clustering with constraints
Sort
View
ATVA
2006
Springer
109views Hardware» more  ATVA 2006»
13 years 7 months ago
Proactive Leader Election in Asynchronous Shared Memory Systems
Abstract. In this paper, we give an algorithm for fault-tolerant proactive leader election in asynchronous shared memory systems, and later its formal verification. Roughly speakin...
M. C. Dharmadeep, K. Gopinath
MASCOTS
2008
13 years 7 months ago
Tackling the Memory Balancing Problem for Large-Scale Network Simulation
A key obstacle to large-scale network simulation over PC clusters is the memory balancing problem where a memory-overloaded machine can slow down an entire simulation due to disk ...
Hyojeong Kim, Kihong Park
NIPS
2007
13 years 7 months ago
Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
Amir Globerson, Tommi Jaakkola
BMCBI
2007
162views more  BMCBI 2007»
13 years 5 months ago
Three-Dimensional Phylogeny Explorer: Distinguishing paralogs, lateral transfer, and violation of "molecular clock" assumption w
Background: Construction and interpretation of phylogenetic trees has been a major research topic for understanding the evolution of genes. Increases in sequence data and complexi...
Namshin Kim, Christopher Lee
ALGORITHMICA
2006
139views more  ALGORITHMICA 2006»
13 years 5 months ago
CONQUEST: A Coarse-Grained Algorithm for Constructing Summaries of Distributed Discrete Datasets
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
Jie Chi, Mehmet Koyutürk, Ananth Grama