Sciweavers

746 search results - page 8 / 150
» Fast (Structured) Newton Computations
Sort
View
ICIP
2001
IEEE
14 years 9 months ago
Fast computation of morphological area pattern spectra
An area based counterpart of the binary structural opening spectra is developed. It is shown that these area opening and closing spectra can be computed using an adaptation of Tar...
Arnold Meijster, Michael H. F. Wilkinson
CVPR
2009
IEEE
15 years 2 months ago
Efficient Reduction of L-infinity Geometry Problems
This paper presents a new method for computing optimal L1 solutions for vision geometry problems, particularly for those problems of fixed-dimension and of large-scale. Our strat...
Hongdong Li (Australian National University)
TMI
2008
141views more  TMI 2008»
13 years 7 months ago
Fast Noise Reduction in Computed Tomography for Improved 3-D Visualization
Computed tomography (CT) has a trend towards higher resolution and higher noise. This development has increased the interest in anisotropic smoothing techniques for CT, which aim t...
Michiel Schaap, Arnold M. R. Schilham, Karel J. Zu...
CSB
2004
IEEE
142views Bioinformatics» more  CSB 2004»
13 years 11 months ago
FastR: Fast Database Search Tool for Non-Coding RNA
The discovery of novel non-coding RNAs has been among the most exciting recent developments in Biology. Yet, many more remain undiscovered. It has been hypothesized that there is ...
Vineet Bafna, Shaojie Zhang
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
14 years 8 months ago
A fast algorithm for computing steiner edge connectivity
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
Richard Cole, Ramesh Hariharan