Sciweavers

1160 search results - page 110 / 232
» Revisiting the Sequence Constraint
Sort
View
WCC
2005
Springer
130views Cryptology» more  WCC 2005»
15 years 12 months ago
On the Design of Codes for DNA Computing
In this paper, we describe a broad class of problems arising in the context of designing codes for DNA computing. We primarily focus on design considerations pertaining to the phen...
Olgica Milenkovic, Navin Kashyap
ALENEX
2003
137views Algorithms» more  ALENEX 2003»
15 years 7 months ago
The Markov Chain Simulation Method for Generating Connected Power Law Random Graphs
Graph models for real-world complex networks such as the Internet, the WWW and biological networks are necessary for analytic and simulation-based studies of network protocols, al...
Christos Gkantsidis, Milena Mihail, Ellen W. Zegur...
JBCB
2006
60views more  JBCB 2006»
15 years 6 months ago
Efficient Algorithms and Software for Detection of Full-length Ltr Retrotransposons
LTR retrotransposons constitute one of the most abundant classes of repetitive elements in eukaryotic genomes. In this paper, we present a new algorithm for detection of full-leng...
Anantharaman Kalyanaraman, Srinivas Aluru
TIT
2008
74views more  TIT 2008»
15 years 6 months ago
Optimal Parsing Trees for Run-Length Coding of Biased Data
Abstract-- We study coding schemes which encode unconstrained sequences into run-length-limited (d, k)-constrained sequences. We present a general framework for the construction of...
Sharon Aviran, Paul H. Siegel, Jack K. Wolf
CVPR
2005
IEEE
16 years 8 months ago
Radon-Based Structure from Motion without Correspondences
We present a novel approach for the estimation of 3Dmotion directly from two images using the Radon transform. We assume a similarity function defined on the crossproduct of two i...
Ameesh Makadia, Christopher Geyer, Shankar Sastry,...