Sciweavers

4281 search results - page 747 / 857
» How to Disembed a Program
Sort
View
IANDC
2008
141views more  IANDC 2008»
13 years 10 months ago
Graph connectivity, partial words, and a theorem of Fine and Wilf
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodi...
BMCBI
2006
122views more  BMCBI 2006»
13 years 10 months ago
PET-Tool: a software suite for comprehensive processing and managing of Paired-End diTag (PET) sequence data
Background: We recently developed the Paired End diTag (PET) strategy for efficient characterization of mammalian transcriptomes and genomes. The paired end nature of short PET se...
Kuo Ping Chiu, Chee-Hong Wong, Qiongyu Chen, Prami...
SODA
2012
ACM
212views Algorithms» more  SODA 2012»
12 years 1 months ago
Parallelism and time in hierarchical self-assembly
We study the role that parallelism plays in time complexariants of Winfree’s abstract Tile Assembly Model (aTAM), a model of molecular algorithmic self-assembly. In the “hiera...
Ho-Lin Chen, David Doty
ICCV
2009
IEEE
15 years 3 months ago
Image Segmentation with A Bounding Box Prior
User-provided object bounding box is a simple and popular interaction paradigm considered by many existing interactive image segmentation frameworks. However, these frameworks t...
Victor Lempitsky, Pushmeet Kohli, Carsten Rother, ...
ECCV
2002
Springer
15 years 19 days ago
Minimal Surfaces for Stereo
Abstract. Determining shape from stereo has often been posed as a global minimization problem. Once formulated, the minimization problems are then solved with a variety of algorith...
Chris Buehler, Steven J. Gortler, Michael F. Cohen...