Sciweavers

1450 search results - page 269 / 290
» On the Complexity of Hardness Amplification
Sort
View
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
13 years 9 months ago
Fast and reliable reconstruction of phylogenetic trees with very short edges
Abstract Ilan Gronau Shlomo Moran Sagi Snir Phylogenetic reconstruction is the problem of reconstructing an evolutionary tree from sequences corresponding to leaves of that tree. ...
Ilan Gronau, Shlomo Moran, Sagi Snir
RIVF
2007
13 years 9 months ago
Stochastic routing in large grid-shaped quantum networks
— This paper investigates the problem of secret key transmissions for an arbitrary Alice-Bob pair in Quantum Key Distribution (QKD)-based networks. We develop a realistic QKDbase...
Cuong Le Quoc, Patrick Bellot, Akim Demaille
AAAI
2006
13 years 9 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer
DAGSTUHL
2006
13 years 9 months ago
Cognitive Vision Needs Attention to Link Sensing with Recognition
Abstract. "Cognitive computer vision is concerned with integration and control of vision systems using explicit but not necessarily symbolic models of context, situation and g...
John K. Tsotsos
DCEIS
2006
13 years 9 months ago
Semantic Coherence in Software Engineering
During software engineering processes lots of artifacts are produced to document the development of a concrete software. For artifacts which are related with respect to their meani...
Michael Skusa