746 search results - page 49 / 150 » Fast (Structured) Newton Computations |
ISAAC
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
CVPR
2006
IEEE
14 years 4 months ago
2006
IEEE
In this paper we consider region-based variational segmentation of two- and three-dimensional images by the minimization of functionals whose fidelity term is the quotient of two...
DOCENG
2006
ACM
14 years 4 months ago
2006
ACM
With the advent of XML we have seen a renewed interest in methods for computing the difference between trees. Methods that include heuristic elements play an important role in pr...
SPAA
2010
ACM
14 years 3 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
ICASSP
2008
IEEE
14 years 4 months ago
2008
IEEE
In this paper, we propose a systemic approach for synthesizing field-programmable gate array (FPGA) implementations of fast Fourier transform (FFT) computations. Our approach cons...