Sciweavers

7978 search results - page 545 / 1596
» Combining shared-coin algorithms
Sort
View
IPMI
2011
Springer
14 years 10 months ago
Actin Filament Segmentation Using Dynamic Programming
Abstract. We introduce a novel algorithm for actin filament segmentation in 2D TIRFM image sequences. This problem is difficult because actin filaments dynamically change shapes ...
Hongsheng Li, Tian Shen, Xiaolei Huang
JACM
2011
152views more  JACM 2011»
14 years 10 months ago
Robust principal component analysis?
This paper is about a curious phenomenon. Suppose we have a data matrix, which is the superposition of a low-rank component and a sparse component. Can we recover each component i...
Emmanuel J. Candès, Xiaodong Li, Yi Ma, Joh...
359
Voted
JCDL
2011
ACM
374views Education» more  JCDL 2011»
14 years 10 months ago
Comparative evaluation of text- and citation-based plagiarism detection approaches using guttenplag
Various approaches for plagiarism detection exist. All are based on more or less sophisticated text analysis methods such as string matching, fingerprinting or style comparison. I...
Bela Gipp, Norman Meuschke, Jöran Beel
NI
2011
168views more  NI 2011»
14 years 10 months ago
Automated Reconstruction of Dendritic and Axonal Trees by Global Optimization with Geometric Priors
We present a novel probabilistic approach to fully automated delineation of tree structures in noisy 2D images and 3D image stacks. Unlike earlier methods that rely mostly on local...
Engin Türetken, Germán González...
PLDI
2011
ACM
14 years 9 months ago
Data representation synthesis
We consider the problem of specifying combinations of data structures with complex sharing in a manner that is both declarative lts in provably correct code. In our approach, abst...
Peter Hawkins, Alex Aiken, Kathleen Fisher, Martin...