Sciweavers

412 search results - page 56 / 83
» Completion for Multiple Reduction Orderings
Sort
View
PODC
2012
ACM
11 years 9 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...
GTTSE
2007
Springer
14 years 1 months ago
Model Transformations for the Compilation of Multi-processor Systems-on-Chip
With the increase of amount of transistors which can be contained on a chip and the constant expectation for more sophisticated applications, the design of Systems-on-Chip (SoC) is...
Éric Piel, Philippe Marquet, Jean-Luc Dekey...
BIBE
2007
IEEE
127views Bioinformatics» more  BIBE 2007»
14 years 1 months ago
A Heuristic for Phylogenetic Reconstruction Using Transposition
Abstract—Because of the advent of high-throughput sequencing and the consequent reduction in cost of sequencing, many organisms have been completely sequenced and most of their g...
Feng Yue, Meng Zhang, Jijun Tang
ADHOC
2005
143views more  ADHOC 2005»
13 years 7 months ago
Active query forwarding in sensor networks
While sensor networks are going to be deployed in diverse application specific contexts, one unifying view is to treat them essentially as distributed databases. The simplest mech...
Narayanan Sadagopan, Bhaskar Krishnamachari, Ahmed...
ATAL
2007
Springer
14 years 1 months ago
Eliciting single-peaked preferences using comparison queries
Voting is a general method for aggregating the preferences of multiple agents. Each agent ranks all the possible alternatives, and based on this, an aggregate ranking of the alter...
Vincent Conitzer