Sciweavers

1000 search results - page 200 / 200
» order 2011
Sort
View
ICSE
2012
IEEE-ACM
11 years 7 months ago
Engineering and verifying requirements for programmable self-assembling nanomachines
—We propose an extension of van Lamsweerde’s goal-oriented requirements engineering to the domain of programmable DNA nanotechnology. This is a domain in which individual devic...
Robyn R. Lutz, Jack H. Lutz, James I. Lathrop, Tit...
ALGORITHMICA
2011
12 years 11 months ago
On Bounded Leg Shortest Paths Problems
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
Liam Roditty, Michael Segal
BMCBI
2011
12 years 11 months ago
PileLine: a toolbox to handle genome position information in next-generation sequencing studies
Background: Genomic position (GP) files currently used in next-generation sequencing (NGS) studies are always difficult to manipulate due to their huge size and the lack of approp...
Daniel Glez-Peña, Gonzalo Gómez-L&oa...
ACL
2011
12 years 8 months ago
Disentangling Chat with Local Coherence Models
‡e ev—lu—te sever—l popul—r models of lo™—l dis™ourse ™oheren™e for dom—in —nd t—sk genE er—lity ˜y —pplying them to ™h—t disent—ngleE mentF …sing experiments ...
Micha Elsner, Eugene Charniak
ICALP
2011
Springer
12 years 8 months ago
Improved Approximation for the Directed Spanner Problem
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
Piotr Berman, Arnab Bhattacharyya, Konstantin Maka...