Sciweavers

189 search results - page 23 / 38
» Polynomial-time Computation via Local Inference Relations
Sort
View
3DPVT
2002
IEEE
146views Visualization» more  3DPVT 2002»
15 years 2 months ago
Geometry of Contour-based Correspondence for Stereo
We consider the problem of computing stereo correspondence for scenes dense in physical structure, such as a bouquet of flowers. Boundaries are then space curves, formally govern...
Steven W. Zucker, Gang Li
BMCBI
2010
121views more  BMCBI 2010»
14 years 7 months ago
Computing DNA duplex instability profiles efficiently with a two-state model: trends of promoters and binding sites
Background: DNA instability profiles have been used recently for predicting the transcriptional start site and the location of core promoters, and to gain insight into promoter ac...
Miriam R. Kantorovitz, Zoi Rapti, Vladimir Gelev, ...
BMCBI
2006
145views more  BMCBI 2006»
14 years 9 months ago
Fast-Find: A novel computational approach to analyzing combinatorial motifs
Background: Many vital biological processes, including transcription and splicing, require a combination of short, degenerate sequence patterns, or motifs, adjacent to defined seq...
Micah Hamady, Erin Peden, Rob Knight, Ravinder Sin...
ICS
2010
Tsinghua U.
15 years 7 months ago
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
CVPR
1999
IEEE
15 years 11 months ago
Fundamental Bounds on Edge Detection: An Information Theoretic Evaluation of Different Edge Cues
We treat the problem of edge detection as one of statistical inference. Local edge cues, implemented by filters, provide information about the likely positions of edges which can ...
Scott Konishi, Alan L. Yuille, James M. Coughlan, ...