Sciweavers

10608 search results - page 82 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
IJBRA
2007
88views more  IJBRA 2007»
13 years 10 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»
13 years 9 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
ICIP
1997
IEEE
14 years 11 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
14 years 11 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...
ICALP
2009
Springer
14 years 10 months ago
Towards a Study of Low-Complexity Graphs
Abstract. We propose the study of graphs that are defined by lowcomplexity distributed and deterministic agents. We suggest that this viewpoint may help introduce the element of in...
Sanjeev Arora, David Steurer, Avi Wigderson