Sciweavers

238 search results - page 29 / 48
» Parallel Algorithm for Maximum Weight Matching in Trees
Sort
View
IPPS
2006
IEEE
15 years 3 months ago
Phylospaces: reconstructing evolutionary trees in tuple space
Phylospaces is a novel framework for reconstructing evolutionary trees in tuple space, a distributed shared memory that permits processes to communicate and coordinate with each o...
Marc L. Smith, Tiffani L. Williams
IPPS
2010
IEEE
14 years 7 months ago
A scalable algorithm for maintaining perpetual system connectivity in dynamic distributed systems
We investigate the problem of maintaining a topology with small degree as well as small diameter in a dynamic distributed system such that the system always stays connected and pr...
Tarun Bansal, Neeraj Mittal
ISCA
1998
IEEE
135views Hardware» more  ISCA 1998»
15 years 1 months ago
Branch Prediction Based on Universal Data Compression Algorithms
Data compression and prediction are closely related. Thus prediction methods based on data compression algorithms have been suggested for the branch prediction problem. In this wo...
Eitan Federovsky, Meir Feder, Shlomo Weiss
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
15 years 10 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
CCR
2004
153views more  CCR 2004»
14 years 9 months ago
Tree bitmap: hardware/software IP lookups with incremental updates
IP address lookup is challenging for high performance routers because it requires a longest matching prefix at speeds of up to 10 Gbps (OC-192). Existing solutions have poor updat...
Will Eatherton, George Varghese, Zubin Dittia