Sciweavers

1057 search results - page 43 / 212
» Theoretical and Experimental DNA Computation
Sort
View
FOCS
2000
IEEE
15 years 1 months ago
Topological Persistence and Simplification
We formalize a notion of topological simplification within the framework of a filtration, which is the history of a growing complex. We classify a topological change that happens ...
Herbert Edelsbrunner, David Letscher, Afra Zomorod...
IMSCCS
2006
IEEE
15 years 3 months ago
Combining Comparative Genomics with de novo Motif Discovery to Identify Human Transcription Factor DNA-Binding Motifs
Background: As more and more genomes are sequenced, comparative genomics approaches provide a methodology for identifying conserved regulatory elements that may be involved in gen...
Linyong Mao, W. Jim Zheng
55
Voted
CSE
2009
IEEE
15 years 1 months ago
Efficient Broadcast on Area of Interest in Voronoi Overlays
This paper presents an algorithm to perform the broadcasting of a packet to all the peers that are located into a convex region (Area of Interest) in a Voronoi based peer-topeer ne...
Michele Albano, Ranieri Baraglia, Matteo Mordacchi...
67
Voted
MICCAI
2005
Springer
15 years 10 months ago
Fast and Simple Calculus on Tensors in the Log-Euclidean Framework
Computations on tensors have become common with the use of DT-MRI. But the classical Euclidean framework has many defects, and affine-invariant Riemannian metrics have been propose...
Vincent Arsigny, Pierre Fillard, Xavier Pennec, Ni...
RTA
2009
Springer
15 years 4 months ago
Dependency Pairs and Polynomial Path Orders
Abstract. We show how polynomial path orders can be employed efficiently in conjunction with weak innermost dependency pairs to automatically certify the polynomial runtime comple...
Martin Avanzini, Georg Moser