Sciweavers

746 search results - page 42 / 150
» Fast (Structured) Newton Computations
Sort
View
VIS
2003
IEEE
116views Visualization» more  VIS 2003»
14 years 11 months ago
Space Efficient Fast Isosurface Extraction for Large Datasets
In this paper, we present a space efficient algorithm for speeding up isosurface extraction. Even though there exist algorithms that can achieve optimal search performance to iden...
Udeepta Bordoloi, Han-Wei Shen
BMCBI
2008
102views more  BMCBI 2008»
13 years 10 months ago
Fast splice site detection using information content and feature reduction
Background: Accurate identification of splice sites in DNA sequences plays a key role in the prediction of gene structure in eukaryotes. Already many computational methods have be...
A. K. M. A. Baten, Saman K. Halgamuge, Bill C. H. ...
CVPR
2011
IEEE
13 years 6 months ago
Fast Cost-Volume Filtering for Visual Correspondence and Beyond
Many computer vision tasks can be formulated as labeling problems. The desired solution is often a spatially smooth labeling where label transitions are aligned with color edges o...
Christoph Rhemann, Asmaa Hosni, Michael Bleyer, Ca...
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
14 years 4 months ago
Fast Random Walk with Restart and Its Applications
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
Hanghang Tong, Christos Faloutsos, Jia-Yu Pan
MP
2011
13 years 1 months ago
An interior-point piecewise linear penalty method for nonlinear programming
We present an interior-point penalty method for nonlinear programming (NLP), where the merit function consists of a piecewise linear penalty function (PLPF) and an 2-penalty functi...
Lifeng Chen, Donald Goldfarb