Sciweavers

1923 search results - page 112 / 385
» Weighted Decision Trees
Sort
View
BMCBI
2010
74views more  BMCBI 2010»
15 years 6 months ago
A weighted q-gram method for glycan structure classification
Background: Glycobiology pertains to the study of carbohydrate sugar chains, or glycans, in a particular cell or organism. Many computational approaches have been proposed for ana...
Limin Li, Wai-Ki Ching, Takako Yamaguchi, Kiyoko F...
ESA
2009
Springer
144views Algorithms» more  ESA 2009»
16 years 26 days ago
Narrow-Shallow-Low-Light Trees with and without Steiner Points
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
Michael Elkin, Shay Solomon
SODA
2000
ACM
96views Algorithms» more  SODA 2000»
15 years 7 months ago
Improved Steiner tree approximation in graphs
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...
Gabriel Robins, Alexander Zelikovsky
ICIP
2006
IEEE
16 years 8 months ago
Light Weight Background Blurring for Video Conferencing Applications
Background blurring is an effective way to both preserving privacy and keeping communication effective during video conferencing. This paper proposes a light weight real-time algo...
Cha Zhang, Yong Rui, Li-wei He
COMPGEOM
2006
ACM
16 years 8 days ago
Minimum weight triangulation is NP-hard
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
Wolfgang Mulzer, Günter Rote