Sciweavers

142 search results - page 10 / 29
» Computing Maximum-Scoring Segments in Almost Linear Time
Sort
View
HASKELL
2006
ACM
14 years 1 months ago
Statically typed linear algebra in Haskell
Many numerical algorithms are specified in terms of operations on vectors and matrices. Matrix operations can be executed extremely efficiently using specialized linear algebra k...
Frederik Eaton
SIAMSC
2008
237views more  SIAMSC 2008»
13 years 7 months ago
A Variational Shape Optimization Approach for Image Segmentation with a Mumford--Shah Functional
We introduce a novel computational method for a Mumford-Shah functional, which decomposes a given image into smooth regions separated by closed curves. Casting this as a shape opti...
Günay Dogan, Pedro Morin, Ricardo H. Nochetto
FOCS
1999
IEEE
13 years 11 months ago
Taking a Walk in a Planar Arrangement
We present a randomized algorithm for computing portions of an arrangement of n arcs in the plane, each pair of which intersect in at most t points. We use this algorithm to perfo...
Sariel Har-Peled
KDD
2008
ACM
186views Data Mining» more  KDD 2008»
14 years 7 months ago
Cut-and-stitch: efficient parallel learning of linear dynamical systems on smps
Multi-core processors with ever increasing number of cores per chip are becoming prevalent in modern parallel computing. Our goal is to make use of the multi-core as well as multi...
Lei Li, Wenjie Fu, Fan Guo, Todd C. Mowry, Christo...
ICCAD
2010
IEEE
158views Hardware» more  ICCAD 2010»
13 years 5 months ago
Novel binary linear programming for high performance clock mesh synthesis
Clock mesh is popular in high performance VLSI design because it is more robust against variations than clock tree at a cost of higher power consumption. In this paper, we propose ...
Minsik Cho, David Z. Pan, Ruchir Puri