Sciweavers

1087 search results - page 141 / 218
» Generation under Space Constraints
Sort
View
130
Voted
IANDC
2008
105views more  IANDC 2008»
15 years 23 days ago
Symbolic protocol analysis for monoidal equational theories
We are interested in the design of automated procedures for analyzing the (in)security of cryptographic protocols in the Dolev-Yao model for a bounded number of sessions when we t...
Stéphanie Delaune, Pascal Lafourcade, Denis...
JKM
2006
135views more  JKM 2006»
15 years 20 days ago
Learning from the Mars Rover Mission: scientific discovery, learning and memory
Purpose Knowledge management for space exploration is part of a multi-generational effort. Each mission builds on knowledge from prior missions, and learning is the first step in ...
Charlotte Linde
97
Voted
APPROX
2009
Springer
136views Algorithms» more  APPROX 2009»
15 years 7 months ago
Succinct Representation of Codes with Applications to Testing
Motivated by questions in property testing, we search for linear error-correcting codes that have the “single local orbit” property: i.e., they are specified by a single loca...
Elena Grigorescu, Tali Kaufman, Madhu Sudan
BMCBI
2010
154views more  BMCBI 2010»
15 years 25 days ago
An algorithm for automated closure during assembly
Background: Finishing is the process of improving the quality and utility of draft genome sequences generated by shotgun sequencing and computational assembly. Finishing can invol...
Sergey Koren, Jason R. Miller, Brian Walenz, Grang...
97
Voted
ICCV
2007
IEEE
16 years 2 months ago
Articulated Shape Matching Using Locally Linear Embedding and Orthogonal Alignment
In this paper we propose a method for matching articulated shapes represented as large sets of 3D points by aligning the corresponding embedded clouds generated by locally linear ...
Diana Mateus, Fabio Cuzzolin, Radu Horaud, Edmond ...