Sciweavers

10988 search results - page 136 / 2198
» Algorithmic Folding Complexity
Sort
View
DCG
2008
86views more  DCG 2008»
15 years 2 months ago
Reconstruction Using Witness Complexes
We present a novel reconstruction algorithm that, given an input point set sampled from an object S, builds a one-parameter family of complexes that approximate S at different sca...
Leonidas J. Guibas, Steve Oudot
103
Voted
IJBRA
2007
88views more  IJBRA 2007»
15 years 2 months ago
Finding molecular complexes through multiple layer clustering of protein interaction networks
: Clustering protein-protein interaction networks (PINs) helps to identify complexes that guide the cell machinery. Clustering algorithms often create a flat clustering, without co...
Bill Andreopoulos, Aijun An, Xiangji Huang, Xiaoga...
JSAC
1998
81views more  JSAC 1998»
15 years 2 months ago
Early Detection and Trellis Splicing: Reduced-Complexity Iterative Decoding
Abstract—The excellent bit error rate performance of new iterative decoding algorithms (e.g., turbodecoding) is achieved at the expense of a computationally burdensome decoding p...
Brendan J. Frey, Frank R. Kschischang
102
Voted
ICIP
1997
IEEE
16 years 4 months ago
Complexity-Regularized Image Denoising
We develop a new approach to image denoising based on complexity regularization. This technique presents a flexible alternative to the more conventional l2 , l1 , and Besov regula...
Juan Liu, Pierre Moulin
ICPR
2008
IEEE
16 years 3 months ago
Semi-supervised learning on large complex simulations
Complex simulations can generate very large amounts of data stored disjointly across many local disks. Learning from this data can be problematic due to the difficulty of obtainin...
John Nicholas Korecki, Kevin W. Bowyer, Larry O. H...