Sciweavers

6740 search results - page 321 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
STOC
2009
ACM
159views Algorithms» more  STOC 2009»
16 years 4 months ago
Message passing algorithms and improved LP decoding
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
Sanjeev Arora, Constantinos Daskalakis, David Steu...
ICDE
2010
IEEE
322views Database» more  ICDE 2010»
16 years 3 months ago
XML-Based Computation for Scientific Workflows
Scientific workflows are increasingly used for rapid integration of existing algorithms to form larger and more comgrams. Such workflows promise to provide more abstract, yet execu...
Bertram Ludäscher, Daniel Zinn, Shawn Bowers
133
Voted
ISMIR
2004
Springer
124views Music» more  ISMIR 2004»
15 years 9 months ago
A Comparison of Rhythmic Similarity Measures
Measuring the similarity between rhythms is a fundamental problem in computational music theory, with many applications such as music information retrieval and copyright infringem...
Godfried T. Toussaint
BMCBI
2005
147views more  BMCBI 2005»
15 years 4 months ago
GATA: a graphic alignment tool for comparative sequence analysis
Background: Several problems exist with current methods used to align DNA sequences for comparative sequence analysis. Most dynamic programming algorithms assume that conserved se...
David A. Nix, Michael B. Eisen
214
Voted
CVPR
2012
IEEE
13 years 6 months ago
A learning-based framework for depth ordering
Depth ordering is instrumental for understanding the 3D geometry of an image. We as humans are surprisingly good ordering even with abstract 2D line drawings. In this paper we pro...
Zhaoyin Jia, Andrew C. Gallagher, Yao-Jen Chang, T...