Sciweavers

4372 search results - page 234 / 875
» Algorithmic Theories of Everything
Sort
View
PODC
2012
ACM
13 years 8 months ago
Byzantine broadcast in point-to-point networks using local linear coding
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...
Guanfeng Liang, Nitin H. Vaidya
SIAMJO
2010
136views more  SIAMJO 2010»
15 years 17 days ago
A New Exchange Method for Convex Semi-Infinite Programming
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...
Liping Zhang, Soon-Yi Wu, Marco A. López
ICPR
2004
IEEE
16 years 7 months ago
Parameterisation Invariant Statistical Shape Models
In this paper novel theory to automate shape modelling is described. The main idea is to develop a theory that is intrinsically defined for curves, as opposed to a finite sample o...
Johan Karlsson, Anders Ericsson, Kalle Åstr&...
RECOMB
2008
Springer
16 years 6 months ago
DLIGHT - Lateral Gene Transfer Detection Using Pairwise Evolutionary Distances in a Statistical Framework
Abstract. This paper presents an algorithm to detect lateral gene transfer (LGT) on the basis of pairwise evolutionary distances. The prediction is made from a likelihood ratio der...
Christophe Dessimoz, Daniel Margadant, Gaston H. G...
STOC
2002
ACM
107views Algorithms» more  STOC 2002»
16 years 6 months ago
Quantum lower bound for the collision problem
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
Scott Aaronson