Sciweavers

1517 search results - page 151 / 304
» Hardening Functions for Large Scale Distributed Computations
Sort
View
IPPS
1998
IEEE
15 years 8 months ago
Benchmarking the Task Graph Scheduling Algorithms
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
Yu-Kwong Kwok, Ishfaq Ahmad
IEEEPACT
1998
IEEE
15 years 8 months ago
Static Methods in Hybrid Branch Prediction
Hybrid branch predictors combine the predictions of multiple single-level or two-level branch predictors. The prediction-combining hardware -- the "meta-predictor" -may ...
Dirk Grunwald, Donald C. Lindsay, Benjamin G. Zorn
PODC
2012
ACM
13 years 6 months ago
The cost of fault tolerance in multi-party communication complexity
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
Binbin Chen, Haifeng Yu, Yuda Zhao, Phillip B. Gib...
RECOMB
2005
Springer
16 years 4 months ago
Individual Gene Cluster Statistics in Noisy Maps
Abstract. Identification of homologous chromosomal regions is important for understanding evolutionary processes that shape genome evolution, such as genome rearrangements and larg...
Narayanan Raghupathy, Dannie Durand
CVPR
2011
IEEE
14 years 8 months ago
Compact Hashing with Joint Optimization of Search Accuracy and Time
Similarity search, namely, finding approximate nearest neighborhoods, is the core of many large scale machine learning or vision applications. Recently, many research results dem...
Junfeng He, Regunathan Radhakrishnan, Shih-Fu Chan...