Sciweavers

536 search results - page 88 / 108
» Some Lower Bounds for the Complexity of Continuation Methods
Sort
View
SP
2010
IEEE
156views Security Privacy» more  SP 2010»
13 years 6 months ago
Round-Efficient Broadcast Authentication Protocols for Fixed Topology Classes
Abstract--We consider resource-constrained broadcast authentication for n receivers in a static, known network topology. There are only two known broadcast authentication protocols...
Haowen Chan, Adrian Perrig
3DPVT
2004
IEEE
181views Visualization» more  3DPVT 2004»
14 years 6 days ago
Segmenting Correlation Stereo Range Images using Surface Elements
This paper describes methods for segmenting planar surfaces from noisy 3D data obtained from correlation stereo vision. We make use of local planar surface elements called patchle...
Don Murray, James J. Little
CORR
2007
Springer
106views Education» more  CORR 2007»
13 years 8 months ago
Bandit Algorithms for Tree Search
Bandit based methods for tree search have recently gained popularity when applied to huge trees, e.g. in the game of go [6]. Their efficient exploration of the tree enables to ret...
Pierre-Arnaud Coquelin, Rémi Munos
BICOB
2009
Springer
14 years 3 months ago
Assembly of Large Genomes from Paired Short Reads
The de novo assembly of genomes from high-throughput short reads is an active area of research. Several promising methods have been recently developed, with applicability mainly re...
Benjamin G. Jackson, Patrick S. Schnable, Srinivas...
NMR
2004
Springer
14 years 1 months ago
Plan reversals for recovery in execution monitoring
In this paper, we introduce a new method to recover from discrepancies in a general monitoring framework where the agent finds some explanations (points of failure) for discrepan...
Thomas Eiter, Esra Erdem, Wolfgang Faber