Sciweavers

831 search results - page 91 / 167
» Finding Minimum Data Requirements Using Pseudo-independence
Sort
View
MICCAI
2002
Springer
14 years 11 months ago
Accurate and High Quality Triangle Models from 3D Grey Scale Images
Visualization of medical data requires the extraction of surfaces that represent the boundaries of objects of interest. This paper describes a method that combines finding these bo...
Paul W. de Bruin, P. M. van Meeteren, Frans Vos, A...
BMCBI
2006
139views more  BMCBI 2006»
13 years 10 months ago
DNA Molecule Classification Using Feature Primitives
Background: We present a novel strategy for classification of DNA molecules using measurements from an alpha-Hemolysin channel detector. The proposed approach provides excellent c...
Raja Tanveer Iqbal, Matthew Landry, Stephen Winter...
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
14 years 10 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
GECCO
2003
Springer
162views Optimization» more  GECCO 2003»
14 years 3 months ago
Optimization of Spare Capacity in Survivable WDM Networks
A network with restoration capability requires spare capacity to be used in the case of failure. Optimization of spare capacity is to find the minimum amount of spare capacity for ...
H. W. Chong, Sam Kwong
KDD
2004
ACM
211views Data Mining» more  KDD 2004»
14 years 10 months ago
Towards parameter-free data mining
Most data mining algorithms require the setting of many input parameters. Two main dangers of working with parameter-laden algorithms are the following. First, incorrect settings ...
Eamonn J. Keogh, Stefano Lonardi, Chotirat (Ann) R...