Sciweavers

993 search results - page 120 / 199
» A Fast Optimization Method for Level Set Segmentation
Sort
View
140
Voted
CIKM
2005
Springer
15 years 8 months ago
Opportunity map: a visualization framework for fast identification of actionable knowledge
Data mining techniques frequently find a large number of patterns or rules, which make it very difficult for a human analyst to interpret the results and to find the truly interes...
Kaidi Zhao, Bing Liu, Thomas M. Tirpak, Weimin Xia...
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
16 years 3 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran
146
Voted
VMV
2001
132views Visualization» more  VMV 2001»
15 years 4 months ago
Optimal Memory Constrained Isosurface Extraction
Efficient isosurface extraction from large volume data sets requires special algorithms and data structures. Such algorithms typically either use a hierarchical spatial subdivisio...
Dietmar Saupe, Jürgen Toelke
117
Voted
LWA
2007
15 years 4 months ago
Parameter Learning for a Readability Checking Tool
This paper describes the application of machine learning methods to determine parameters for DeLite, a readability checking tool. DeLite pinpoints text segments that are difficul...
Tim vor der Brück, Johannes Leveling
119
Voted
ISBI
2004
IEEE
16 years 3 months ago
Differentiable Minimin Shape Distance For Incorporating Topological Priors in Biomedical Imaging
In the application of curve evolution and level set methods to biomedical image analysis, the incorporation of geometric priors for isolated shapes has been proved useful. On the ...
Yonggang Shi, William Clement Karl